Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Elias Koutsoupias
2010 – today
- 2013
[j26]Elias Koutsoupias, Angelina Vidali: A Lower Bound of 1+φ for Truthful Scheduling Mechanisms. Algorithmica 66(1): 211-223 (2013)- [j25]Spyros C. Kontogiannis, Elias Koutsoupias, Pavlos G. Spirakis: Preface to Special Issue on Algorithmic Game Theory. Theory Comput. Syst. 53(1): 1-2 (2013)
- [j24]Elias Koutsoupias, George Pierrakos: On the Competitive Ratio of Online Sampling Auctions. ACM Trans. Economics and Comput. 1(2): 10 (2013)
- [c40]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali: Approaching utopia: strong truthfulness and externality-resistant mechanisms. ITCS 2013: 221-230
- [c39]Sayan Bhattacharya, Elias Koutsoupias, Janardhan Kulkarni, Stefano Leonardi, Tim Roughgarden, Xiaoming Xu: Near-optimal multi-unit auctions with ordered bidders. ACM Conference on Electronic Commerce 2013: 91-102
- 2012
- [j23]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)
- [c38]Elias Koutsoupias, Katia Papakonstantinopoulou: Contention Issues in Congestion Games. ICALP (2) 2012: 623-635
- [c37]Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour, Svetlana Olonetsky: Beyond myopic best response (in Cournot competition). SODA 2012: 993-1005
- [c36]Yiannis Giannakopoulos, Elias Koutsoupias: Competitive Analysis of Maintaining Frequent Items of a Stream. SWAT 2012: 340-351
- [i4]Amos Fiat, Anna R. Karlin, Elias Koutsoupias, Angelina Vidali: Approaching Utopia: Strong Truthfulness and Externality-Resistant Mechanisms. CoRR abs/1208.3939 (2012)
- [i3]Elias Koutsoupias, Stefano Leonardi, Tim Roughgarden: Near-Optimal Multi-Unit Auctions with Ordered Bidders. CoRR abs/1212.2825 (2012)
- 2011
- [j22]George Christodoulou, Elias Koutsoupias, Paul G. Spirakis: On the Performance of Approximate Equilibria in Congestion Games. Algorithmica 61(1): 116-140 (2011)
- [c35]Elias Koutsoupias: Recent Developments in the Mechanism Design Problem for Scheduling. FAW-AAIM 2011: 6-7
- [c34]
- [e2]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
- 2010
- [j21]George Christodoulou, Elias Koutsoupias, Annamária Kovács: Mechanism design for fractional scheduling on unrelated machines. ACM Transactions on Algorithms 6(2) (2010)
- [c33]Elias Koutsoupias, George Pierrakos: On the Competitive Ratio of Online Sampling Auctions. WINE 2010: 327-338
- [e1]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
2000 – 2009
- 2009
- [j20]George Christodoulou, Elias Koutsoupias, Angelina Vidali: A Lower Bound for Scheduling Mechanisms. Algorithmica 55(4): 729-740 (2009)
- [j19]Elias Koutsoupias, Christos H. Papadimitriou: Worst-case equilibria. Computer Science Review 3(2): 65-69 (2009)
- [j18]
- [j17]George Christodoulou, Elias Koutsoupias: Mechanism Design for Scheduling. Bulletin of the EATCS 97: 40-59 (2009)
- [j16]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)
- [j15]George Christodoulou, Elias Koutsoupias, Akash Nanavati: Coordination mechanisms. Theor. Comput. Sci. 410(36): 3327-3336 (2009)
- [c32]George Christodoulou, Elias Koutsoupias, Paul G. Spirakis: On the Performance of Approximate Equilibria in Congestion Games. ESA 2009: 251-262
- [c31]Luca Becchetti, Elias Koutsoupias: Competitive Analysis of Aggregate Max in Windowed Streaming. ICALP (1) 2009: 156-170
- 2008
- [c30]George Christodoulou, Elias Koutsoupias, Angelina Vidali: A Characterization of 2-Player Mechanisms for Scheduling. ESA 2008: 297-307
- [i2]George Christodoulou, Elias Koutsoupias, Paul G. Spirakis: On the performance of approximate equilibria in congestion games. CoRR abs/0804.3160 (2008)
- [i1]George Christodoulou, Elias Koutsoupias, Angelina Vidali: A characterization of 2-player mechanisms for scheduling. CoRR abs/0807.3427 (2008)
- 2007
- [c29]George Christodoulou, Elias Koutsoupias, Annamária Kovács: Mechanism Design for Fractional Scheduling on Unrelated Machines. ICALP 2007: 40-52
- [c28]Elias Koutsoupias, Angelina Vidali: A Lower Bound of 1+phi for Truthful Scheduling Mechanisms. MFCS 2007: 454-464
- [c27]Elias Koutsoupias, Panagiota N. Panagopoulou, Paul G. Spirakis: Selfish Load Balancing Under Partial Knowledge. MFCS 2007: 609-620
- [c26]George Christodoulou, Elias Koutsoupias, Angelina Vidali: A lower bound for scheduling mechanisms. SODA 2007: 1163-1170
- 2005
- [c25]George Christodoulou, Elias Koutsoupias: On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. ESA 2005: 59-70
- [c24]George Christodoulou, Elias Koutsoupias: The price of anarchy of finite congestion games. STOC 2005: 67-73
- [c23]Georgios Kouroupas, Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri: Experiments with an Economic Model of the Worldwide Web. WINE 2005: 46-54
- [c22]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
- 2004
- [j14]Marek Chrobak, Elias Koutsoupias: Coordination mechanisms for congestion games. SIGACT News 35(4): 58-71 (2004)
- [j13]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)
- [j12]Elias Koutsoupias, David Scot Taylor: The CNN problem and other k-server variants. Theor. Comput. Sci. 324(2-3): 347-359 (2004)
- [c21]George Christodoulou, Elias Koutsoupias, Akash Nanavati: Coordination Mechanisms. ICALP 2004: 345-357
- [c20]
- [c19]Carlos Brito, Elias Koutsoupias, Shailesh Vaya: Competitive analysis of organization networks or multicast acknowledgement: how much to wait? SODA 2004: 627-635
- 2003
- [j11]
- [j10]Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: Approximate Equilibria and Ball Fusion. Theory Comput. Syst. 36(6): 683-693 (2003)
- [j9]Marek Chrobak, Elias Koutsoupias, John Noga: More on randomized on-line algorithms for caching. Theor. Comput. Sci. 290(3): 1997-2008 (2003)
- [c18]
- 2002
- [j8]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)
- [c17]Alex Fabrikant, Elias Koutsoupias, Christos H. Papadimitriou: Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet. ICALP 2002: 110-122
- [c16]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
- [c15]Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis: Approximate Equilibria and Ball Fusion. SIROCCO 2002: 223-235
- 2000
- [j7]Elias Koutsoupias, Christos H. Papadimitriou: Beyond Competitive Analysis. SIAM J. Comput. 30(1): 300-317 (2000)
- [c14]Richard M. Karp, Elias Koutsoupias, Christos H. Papadimitriou, Scott Shenker: Optimization Problems in Congestion Control. FOCS 2000: 66-74
- [c13]Elias Koutsoupias, David Scot Taylor: The CNN Problem and Other k-Server Variants. STACS 2000: 581-592
- [c12]Yair Bartal, Elias Koutsoupias: On the Competitive Ratio of the Work Function Algorithm for the k-Server Problem. STACS 2000: 605-613
1990 – 1999
- 1999
- [j6]Xiaotie Deng, Elias Koutsoupias, Philip D. MacKenzie: Competitive Implementation of Parallel Programs. Algorithmica 23(1): 14-30 (1999)
- [j5]Eli Gafni, Elias Koutsoupias: Three-Processor Tasks Are Undecidable. SIAM J. Comput. 28(3): 970-983 (1999)
- [c11]
- [c10]
- [c9]
- 1998
- [c8]Elias Koutsoupias, David Scot Taylor: Tight Bounds for 2-Dimensional Indexing Schemes. PODS 1998: 52-58
- 1997
- [c7]Joseph M. Hellerstein, Elias Koutsoupias, Christos H. Papadimitriou: On the Analysis of Indexing Schemes. PODS 1997: 249-256
- 1996
- [j4]Elias Koutsoupias, Christos H. Papadimitriou: The 2-Evader Problem. Inf. Process. Lett. 57(5): 249-252 (1996)
- [c6]Elias Koutsoupias, Christos H. Papadimitriou, Mihalis Yannakakis: Searching a Fixed Graph. ICALP 1996: 280-289
- 1995
- [j3]Elias Koutsoupias, Christos H. Papadimitriou: On the k-Server Conjecture. J. ACM 42(5): 971-983 (1995)
- [c5]Michelangelo Grigni, Elias Koutsoupias, Christos H. Papadimitriou: An Approximation Scheme for Planar Graph TSP. FOCS 1995: 640-645
- [c4]
- 1994
- [c3]
- 1993
- [c2]Xiaotie Deng, Elias Koutsoupias: Competitive Implementation of Parallel Programs. SODA 1993: 455-461
- 1992
- [j2]Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri: On the Optimal Bisection of a Polygon. INFORMS Journal on Computing 4(4): 435-438 (1992)
- [j1]Elias Koutsoupias, Christos H. Papadimitriou: On the Greedy Algorithm for Satisfiability. Inf. Process. Lett. 43(1): 53-55 (1992)
- 1990
- [c1]Elias Koutsoupias, Christos H. Papadimitriou, Martha Sideri: On the Optimal Bisection of a Polygon (Extended Abstract). Symposium on Computational Geometry 1990: 198-202
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 10:02 CEST by the dblp team