Algorithmic Game Theory

5th International Symposium, SAGT 2012, Barcelona, Spain, October 22-23, 2012. Proceedings


ISBN: 978-3-642-33995-0 (Print) 978-3-642-33996-7 (Online)
Download Book (3,932 KB) As a courtesy to our readers the eBook is provided DRM-free. However, please note that Springer uses effective methods and state-of-the art technology to detect, stop, and prosecute illegal sharing to safeguard our authors’ interests.

Table of contents (22 chapters)

previous Page of 2
  1. Front Matter

    Pages -

  2. Book Chapter

    Pages 1-12

    A Classification of Weakly Acyclic Games

  3. Book Chapter

    Pages 13-24

    Selfishness Level of Strategic Games

  4. Book Chapter

    Pages 25-36

    Mechanisms for Scheduling with Single-Bit Private Values

  5. Book Chapter

    Pages 37-48

    The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games

  6. Book Chapter

    Pages 49-60

    An Optimal Bound to Access the Core in TU-Games

  7. Book Chapter

    Pages 61-71

    Convergence of Ordered Improvement Paths in Generalized Congestion Games

  8. Book Chapter

    Pages 72-83

    Basic Network Creation Games with Communication Interests

  9. Book Chapter

    Pages 84-95

    Common Knowledge and State-Dependent Equilibria

  10. Book Chapter

    Pages 96-107

    Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques

  11. Book Chapter

    Pages 108-119

    Approximate Well-Supported Nash Equilibria Below Two-Thirds

  12. Book Chapter

    Pages 120-131

    Mechanisms and Impossibilities for Truthful, Envy-Free Allocations

  13. Book Chapter

    Pages 132-143

    Capacitated Network Design Games

  14. Book Chapter

    Pages 144-155

    Decentralized Dynamics for Finite Opinion Games

  15. Book Chapter

    Pages 156-167

    On the Hardness of Network Design for Bottleneck Routing Games

  16. Book Chapter

    Pages 168-179

    Ad Auctions with Data

  17. Book Chapter

    Pages 180-191

    Commodity Auctions and Frugality Ratios

  18. Book Chapter

    Pages 192-203

    On the Communication Complexity of Approximate Nash Equilibria

  19. Book Chapter

    Pages 204-215

    Congestion Games with Capacitated Resources

  20. Book Chapter

    Pages 216-226

    Network Bargaining: Using Approximate Blocking Sets to Stabilize Unstable Instances

  21. Book Chapter

    Pages 227-238

    Uniform Price Auctions: Equilibria and Efficiency

previous Page of 2