☰

Elias Koutsoupias - Publications

Affiliations: 
University of California, Los Angeles, Los Angeles, CA 
Area:
Computer Science, Mathematics
Tree Info Similar researchers PubMed Report error

31 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Giannakopoulos Y, Koutsoupias E, Kyropoulou M. The anarchy of scheduling without money Theoretical Computer Science. 778: 19-32. DOI: 10.1016/J.Tcs.2019.01.022  0.456
2015 Giannakopoulos Y, Koutsoupias E. Competitive analysis of maintaining frequent items of a stream Theoretical Computer Science. 562: 23-32. DOI: 10.1016/J.Tcs.2014.09.011  0.407
2015 Giannakopoulos Y, Koutsoupias E. Selling two goods optimally Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9135: 650-662. DOI: 10.1016/J.Ic.2018.02.016  0.392
2014 Giannakopoulos Y, Koutsoupias E. Duality and optimality of auctions for uniform distributions Ec 2014 - Proceedings of the 15th Acm Conference On Economics and Computation. 259-276. DOI: 10.1137/16M1072218  0.347
2013 Koutsoupias E, Vidali A. A Lower Bound of 1+φ for Truthful Scheduling Mechanisms Algorithmica. 66: 211-223. DOI: 10.1007/S00453-012-9634-6  0.414
2013 Kontogiannis S, Koutsoupias E, Spirakis P. Preface to Special Issue on Algorithmic Game Theory Theory of Computing Systems. 53: 1-2. DOI: 10.1007/S00224-013-9466-Z  0.367
2012 Fiat A, Koutsoupias E, Ligett K, Mansour Y, Olonetsky S. Beyond myopic best response (in Cournot competition) Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 993-1005. DOI: 10.1016/J.Geb.2013.12.006  0.426
2011 Koutsoupias E. Scheduling without payments Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6982: 143-153. DOI: 10.1007/S00224-013-9473-0  0.44
2010 Christodoulou G, Koutsoupias E, Kovács A. Mechanism design for fractional scheduling on unrelated machines Acm Transactions On Algorithms. 6. DOI: 10.1145/1721837.1721854  0.427
2010 Kontogiannis S, Koutsoupias E, Spirakis PG. Algorithmic Game Theory Lecture Notes in Computer Science. 6386. DOI: 10.1007/978-3-642-16170-4  0.311
2009 Christodoulou G, Koutsoupias E, Nanavati A. Coordination mechanisms Theoretical Computer Science. 410: 3327-3336. DOI: 10.1016/J.Tcs.2009.01.005  0.355
2009 Koutsoupias E, Papadimitriou C. Worst-case equilibria Computer Science Review. 3: 65-69. DOI: 10.1016/J.Cosrev.2009.04.003  0.471
2009 Koutsoupias E. The k-server problem Computer Science Review. 3: 105-118. DOI: 10.1016/J.Cosrev.2009.04.002  0.328
2009 Christodoulou G, Koutsoupias E, Spirakis PG. On the performance of approximate equilibria in congestion games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5757: 251-262. DOI: 10.1007/978-3-642-04128-0_22  0.324
2008 Christodoulou G, Koutsoupias E, Vidali A. A characterization of 2-player mechanisms for scheduling Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5193: 297-307. DOI: 10.1007/978-3-540-87744-8-25  0.326
2007 Koutsoupias E, Vidali A. A lower bound of 1 + φ for truthful scheduling mechanisms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4708: 454-464.  0.313
2005 Christodoulou G, Koutsoupias E. The price of anarchy of finite congestion games Proceedings of the Annual Acm Symposium On Theory of Computing. 67-73. DOI: 10.1145/1060590.1060600  0.372
2005 Koutsoupias E. The price of anarchy of congestion games and coordination mechanisms Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 24: 355.  0.372
2005 Christodoulou G, Koutsoupias E. On the price of anarchy and stability of correlated equilibria of linear congestion games Lecture Notes in Computer Science. 3669: 59-70.  0.317
2004 Chrobak M, Koutsoupias E. Coordination mechanisms for congestion games Sigact News. 35: 58-71. DOI: 10.1145/1054916.1054933  0.489
2004 Bartal Y, Koutsoupias E. On the competitive ratio of the work function algorithm for the k -server problem Theoretical Computer Science. 324: 337-345. DOI: 10.1016/J.Tcs.2004.06.001  0.359
2004 Koutsoupias E. Congestion games and coordination mechanisms Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3153: 177-179.  0.34
2003 Chrobak M, Koutsoupias E, Noga J. More on randomized on-line algorithms for caching Theoretical Computer Science. 290: 1997-2008. DOI: 10.1016/S0304-3975(02)00045-2  0.317
2003 Koutsoupias E, Mavronicolas M, Spirakis P. Approximate Equilibria and Ball Fusion Theory of Computing Systems. 36: 683-693. DOI: 10.1007/S00224-003-1131-5  0.385
2002 Fotakis D, Kontogiannis S, Koutsoupias E, Mavronicolas M, Spirakis P. The structure and complexity of Nash equilibria for a selfish routing game Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2380: 123-134. DOI: 10.1016/J.Tcs.2008.01.004  0.445
2000 Koutsoupias E, Papadimitriou CH. Beyond competitive analysis Siam Journal On Computing. 30: 300-317. DOI: 10.1137/S0097539796299540  0.382
2000 Koutsoupias E, Taylor DS. The CNN problem and other k-server variants Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1770: 581-592. DOI: 10.1016/J.Tcs.2004.06.002  0.315
1999 Gafni E, Koutsoupias E. Three-processor tasks are undecidable Siam Journal On Computing. 28: 970-983. DOI: 10.1137/S0097539796305766  0.353
1995 Koutsoupias E, Papadimitriou CH. On the k-Server Conjecture Journal of the Acm (Jacm). 42: 971-983. DOI: 10.1145/210118.210128  0.345
1992 Koutsoupias E, Papadimitriou CH, Sideri M. On the Optimal Bisection of a Polygon Informs Journal On Computing. 4: 435-438. DOI: 10.1287/Ijoc.4.4.435  0.302
1992 Koutsoupias E, Papadimitriou CH. On the greedy algorithm for satisfiability Information Processing Letters. 43: 53-55. DOI: 10.1016/0020-0190(92)90029-U  0.307
Show low-probability matches.