Elias Koutsoupias

Elias Koutsoupias, Angelina Vidali: A Lower Bound of 1+φ for Truthful Scheduling Mechanisms. Algorithmica 66(1): 211-223 (2013)

Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali: Approaching utopia: strong truthfulness and externality-resistant mechanisms. ITCS 2013: 221-230

Carlos Fisch Brito, Elias Koutsoupias, Shailesh Vaya: Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait? Algorithmica 64(4): 584-605 (2012)

Elias Koutsoupias, Katia Papakonstantinopoulou: Contention Issues in Congestion Games. ICALP (2) 2012: 623-635

Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, Svetlana Olonetsky: Beyond myopic best response (in Cournot competition). SODA 2012: 993-1005

Yiannis Giannakopoulos, Elias Koutsoupias: Competitive Analysis of Maintaining Frequent Items of a Stream. SWAT 2012: 340-351

Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali: Approaching Utopia: Strong Truthfulness and Externality-Resistant Mechanisms. CoRR abs/1208.3939 (2012)

Elias Koutsoupias, Stefano Leonardi, Tim Roughgarden: Near-Optimal Multi-Unit Auctions with Ordered Bidders. CoRR abs/1212.2825 (2012)

George Christodoulou, Elias Koutsoupias, Paul G. Spirakis: On the Performance of Approximate Equilibria in Congestion Games. Algorithmica 61(1): 116-140 (2011)

Elias Koutsoupias: Recent Developments in the Mechanism Design Problem for Scheduling. FAW-AAIM 2011: 6-7

Elias Koutsoupias: Scheduling without Payments. SAGT 2011: 143-153

Ning Chen, Edith Elkind, Elias Koutsoupias (Eds.): Internet and Network Economics - 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011. Proceedings. Lecture Notes in Computer Science 7090, Springer 2011, isbn 978-3-642-25509-0

George Christodoulou, Elias Koutsoupias, Annamária Kovács: Mechanism design for fractional scheduling on unrelated machines. ACM Transactions on Algorithms 6(2) (2010)

Elias Koutsoupias, George Pierrakos: On the Competitive Ratio of Online Sampling Auctions. WINE 2010: 327-338

Spyros C. Kontogiannis, Elias Koutsoupias, Paul G. Spirakis (Eds.): Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings. Lecture Notes in Computer Science 6386, Springer 2010, isbn 978-3-642-16169-8

George Christodoulou, Elias Koutsoupias, Angelina Vidali: A Lower Bound for Scheduling Mechanisms. Algorithmica 55(4): 729-740 (2009)

Elias Koutsoupias, Christos H. Papadimitriou: Worst-case equilibria. Computer Science Review 3(2): 65-69 (2009)

Elias Koutsoupias: The k-server problem. Computer Science Review 3(2): 105-118 (2009)

George Christodoulou, Elias Koutsoupias: Mechanism Design for Scheduling. Bulletin of the EATCS 97: 40-59 (2009)

Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: The structure and complexity of Nash equilibria for a selfish routing game. Theor. Comput. Sci. 410(36): 3305-3326 (2009)

George Christodoulou, Elias Koutsoupias, Akash Nanavati: Coordination mechanisms. Theor. Comput. Sci. 410(36): 3327-3336 (2009)

George Christodoulou, Elias Koutsoupias, Paul G. Spirakis: On the Performance of Approximate Equilibria in Congestion Games. ESA 2009: 251-262

Luca Becchetti, Elias Koutsoupias: Competitive Analysis of Aggregate Max in Windowed Streaming. ICALP (1) 2009: 156-170

George Christodoulou, Elias Koutsoupias, Angelina Vidali: A Characterization of 2-Player Mechanisms for Scheduling. ESA 2008: 297-307

George Christodoulou, Elias Koutsoupias, Paul G. Spirakis: On the performance of approximate equilibria in congestion games. CoRR abs/0804.3160 (2008)

George Christodoulou, Elias Koutsoupias, Angelina Vidali: A characterization of 2-player mechanisms for scheduling. CoRR abs/0807.3427 (2008)

George Christodoulou, Elias Koutsoupias, Annamária Kovács: Mechanism Design for Fractional Scheduling on Unrelated Machines. ICALP 2007: 40-52

Elias Koutsoupias, Angelina Vidali: A Lower Bound of 1+phi for Truthful Scheduling Mechanisms. MFCS 2007: 454-464

Elias Koutsoupias, Panagiota N. Panagopoulou, Paul G. Spirakis: Selfish Load Balancing Under Partial Knowledge. MFCS 2007: 609-620

George Christodoulou, Elias Koutsoupias, Angelina Vidali: A lower bound for scheduling mechanisms. SODA 2007: 1163-1170

George Christodoulou, Elias Koutsoupias: On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. ESA 2005: 59-70

George Christodoulou, Elias Koutsoupias: The price of anarchy of finite congestion games. STOC 2005: 67-73

Georgios Kouroupas, Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri: Experiments with an Economic Model of the Worldwide Web. WINE 2005: 46-54

Georgios Kouroupas, Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri: An economic model of the worldwide web. WWW (Special interest tracks and posters) 2005: 934-935

Marek Chrobak, Elias Koutsoupias: Coordination mechanisms for congestion games. SIGACT News 35(4): 58-71 (2004)

Yair Bartal, Elias Koutsoupias: On the competitive ratio of the work function algorithm for the k-server problem. Theor. Comput. Sci. 324(2-3): 337-345 (2004)

Elias Koutsoupias, David Scot Taylor: The CNN problem and other k-server variants. Theor. Comput. Sci. 324(2-3): 347-359 (2004)

George Christodoulou, Elias Koutsoupias, Akash Nanavati: Coordination Mechanisms. ICALP 2004: 345-357

Elias Koutsoupias: Congestion Games and Coordination Mechanisms. MFCS 2004: 177-179

Carlos Brito, Elias Koutsoupias, Shailesh Vaya: Competitive analysis of organization networks or multicast acknowledgement: how much to wait? SODA 2004: 627-635

Elias Koutsoupias: Selfish Task Allocation. Bulletin of the EATCS 81: 79-88 (2003)

Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: Approximate Equilibria and Ball Fusion. Theory Comput. Syst. 36(6): 683-693 (2003)

Marek Chrobak, Elias Koutsoupias, John Noga: More on randomized on-line algorithms for caching. Theor. Comput. Sci. 290(3): 1997-2008 (2003)

Elias Koutsoupias, Akash Nanavati: The Online Matching Problem on a Line. WAOA 2003: 179-191

Joseph M. Hellerstein, Elias Koutsoupias, Daniel P. Miranker, Christos H. Papadimitriou, Vasilis Samoladas: On a model of indexability and its bounds for range queries. J. ACM 49(1): 35-55 (2002)

Alex Fabrikant, Elias Koutsoupias, Christos H. Papadimitriou: Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet. ICALP 2002: 110-122

Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: The Structure and Complexity of Nash Equilibria for a Selfish Routing Game. ICALP 2002: 123-134

Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: Approximate Equilibria and Ball Fusion. SIROCCO 2002: 223-235

Elias Koutsoupias, Christos H. Papadimitriou: Beyond Competitive Analysis. SIAM J. Comput. 30(1): 300-317 (2000)

Richard M. Karp, Elias Koutsoupias, Christos H. Papadimitriou, Scott Shenker: Optimization Problems in Congestion Control. FOCS 2000: 66-74

Elias Koutsoupias, David Scot Taylor: The CNN Problem and Other k-Server Variants. STACS 2000: 581-592

Yair Bartal, Elias Koutsoupias: On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem. STACS 2000: 605-613

Xiaotie Deng, Elias Koutsoupias, Philip D. MacKenzie: Competitive Implementation of Parallel Programs. Algorithmica 23(1): 14-30 (1999)

Eli Gafni, Elias Koutsoupias: Three-Processor Tasks Are Undecidable. SIAM J. Comput. 28(3): 970-983 (1999)

Elias Koutsoupias: Weak Adversaries for the k-Server Problem. FOCS 1999: 444-449

Elias Koutsoupias, David Scot Taylor: Indexing Schemes for Random Points. SODA 1999: 596-602

Elias Koutsoupias, Christos H. Papadimitriou: Worst-case Equilibria. STACS 1999: 404-413

Elias Koutsoupias, David Scot Taylor: Tight Bounds for 2-Dimensional Indexing Schemes. PODS 1998: 52-58

Joseph M. Hellerstein, Elias Koutsoupias, Christos H. Papadimitriou: On the Analysis of Indexing Schemes. PODS 1997: 249-256

Elias Koutsoupias, Christos H. Papadimitriou: The 2-Evader Problem. Inf. Process. Lett. 57(5): 249-252 (1996)

Elias Koutsoupias, Christos H. Papadimitriou, Mihalis Yannakakis: Searching a Fixed Graph. ICALP 1996: 280-289

Elias Koutsoupias, Christos H. Papadimitriou: On the k-Server Conjecture. J. ACM 42(5): 971-983 (1995)

Michelangelo Grigni, Elias Koutsoupias, Christos H. Papadimitriou: An Approximation Scheme for Planar Graph TSP. FOCS 1995: 640-645

Eli Gafni, Elias Koutsoupias: 3-Processor Tasks Are Undecidable (Abstract). PODC 1995: 271

Elias Koutsoupias, Christos H. Papadimitriou: Beyond Competitive Analysis. FOCS 1994: 394-400

Xiaotie Deng, Elias Koutsoupias: Competitive Implementation of Parallel Programs. SODA 1993: 455-461

Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri: On the Optimal Bisection of a Polygon. INFORMS Journal on Computing 4(4): 435-438 (1992)

Elias Koutsoupias, Christos H. Papadimitriou: On the Greedy Algorithm for Satisfiability. Inf. Process. Lett. 43(1): 53-55 (1992)

Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri: On the Optimal Bisection of a Polygon (Extended Abstract). Symposium on Computational Geometry 1990: 198-202