Skip to main content
SpringerLink
Log in
Book cover

Algorithmic Game Theory

Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010, Proceedings

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Spyros Kontogiannis

    1. Lecturer, Department of Computer Science, University of Ioannina, Ioannina, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Elias Koutsoupias

    1. Department of Informatics and Telecommunications Panepistimiopolis, Ilissia, Professor, National and Kapodistrian University of Athens, Athens, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Paul G. Spirakis

    1. Computer Engineering and Informatics Department (CEID), University of Patras, Patras, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 6386)

Part of the book sub series: Information Systems and Applications, incl. Internet/Web, and HCI (LNISA)

Included in the following conference series:

Conference proceedings info: SAGT 2010.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (30 papers)

  1. Front Matter

    Download chapter PDF

  2. When the Players Are Not Expectation Maximizers

    • Amos Fiat, Christos Papadimitriou
    Pages 1-14

  3. How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?

    • Paul W. Goldberg
    Pages 15-17

  4. A Simplex-Like Algorithm for Fisher Markets

    • Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind Sohoni
    Pages 18-29

  5. Nash Equilibria in Fisher Market

    • Bharat Adsul, Ch. Sobhan Babu, Jugal Garg, Ruta Mehta, Milind Sohoni
    Pages 30-41

  6. Partition Equilibrium Always Exists in Resource Selection Games

    • Elliot Anshelevich, Bugra Caskurlu, Ameya Hate
    Pages 42-53

  7. Mixing Time and Stationary Expected Social Welfare of Logit Dynamics

    • Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale, Giuseppe Persiano
    Pages 54-65

  8. Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games

    • Yonatan Aumann, Yair Dombb
    Pages 66-77

  9. On Nash-Equilibria of Approximation-Stable Games

    • Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum, Or Sheffet, Santosh Vempala
    Pages 78-89

  10. Improved Lower Bounds on the Price of Stability of Undirected Network Design Games

    • Vittorio Bilò, Ioannis Caragiannis, Angelo Fanelli, Gianpiero Monaco
    Pages 90-101

  11. On the Rate of Convergence of Fictitious Play

    • Felix Brandt, Felix Fischer, Paul Harrenstein
    Pages 102-113

  12. On Learning Algorithms for Nash Equilibria

    • Constantinos Daskalakis, Rafael Frongillo, Christos H. Papadimitriou, George Pierrakos, Gregory Valiant
    Pages 114-125

  13. On the Structure of Weakly Acyclic Games

    • Alex Fabrikant, Aaron D. Jaggard, Michael Schapira
    Pages 126-137

  14. A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium

    • Uriel Feige, Inbal Talgam-Cohen
    Pages 138-149

  15. Responsive Lotteries

    • Uriel Feige, Moshe Tennenholtz
    Pages 150-161

  16. On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users

    • Dimitris Fotakis, George Karakostas, Stavros G. Kolliopoulos
    Pages 162-173

  17. Computing Stable Outcomes in Hedonic Games

    • Martin Gairing, Rahul Savani
    Pages 174-185

  18. A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It

    • Gagan Goel, Vijay Vazirani
    Pages 186-197

  19. The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements

    • Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
    Pages 198-209

  20. Complexity of Safe Strategic Voting

    • Noam Hazon, Edith Elkind
    Pages 210-221
Back to top

Other volumes

  1. Algorithmic Game Theory

Keywords

Editors and Affiliations

  • Lecturer, Department of Computer Science, University of Ioannina, Ioannina, Greece

    Spyros Kontogiannis

  • Department of Informatics and Telecommunications Panepistimiopolis, Ilissia, Professor, National and Kapodistrian University of Athens, Athens, Greece

    Elias Koutsoupias

  • Computer Engineering and Informatics Department (CEID), University of Patras, Patras, Greece

    Paul G. Spirakis

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation