↓ Skip to main content
What is this page? Embed badge

Algorithmic Game Theory

Overview of attention for book
Cover of 'Algorithmic Game Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 When the Players Are Not Expectation Maximizers
  3. Altmetric Badge
    Chapter 2 How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
  4. Altmetric Badge
    Chapter 3 A Simplex-Like Algorithm for Fisher Markets
  5. Altmetric Badge
    Chapter 4 Nash Equilibria in Fisher Market
  6. Altmetric Badge
    Chapter 5 Partition Equilibrium Always Exists in Resource Selection Games
  7. Altmetric Badge
    Chapter 6 Mixing Time and Stationary Expected Social Welfare of Logit Dynamics
  8. Altmetric Badge
    Chapter 7 Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games
  9. Altmetric Badge
    Chapter 8 On Nash-Equilibria of Approximation-Stable Games
  10. Altmetric Badge
    Chapter 9 Improved Lower Bounds on the Price of Stability of Undirected Network Design Games
  11. Altmetric Badge
    Chapter 10 Algorithmic Game Theory
  12. Altmetric Badge
    Chapter 11 On Learning Algorithms for Nash Equilibria
  13. Altmetric Badge
    Chapter 12 On the Structure of Weakly Acyclic Games
  14. Altmetric Badge
    Chapter 13 A Direct Reduction from k -Player to 2-Player Approximate Nash Equilibrium
  15. Altmetric Badge
    Chapter 14 Responsive Lotteries
  16. Altmetric Badge
    Chapter 15 On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users
  17. Altmetric Badge
    Chapter 16 Algorithmic Game Theory
  18. Altmetric Badge
    Chapter 17 A Perfect Price Discrimination Market Model with Production, and a (Rational) Convex Program for It
  19. Altmetric Badge
    Chapter 18 The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements
  20. Altmetric Badge
    Chapter 19 Complexity of Safe Strategic Voting
  21. Altmetric Badge
    Chapter 20 Bottleneck Congestion Games with Logarithmic Price of Anarchy
  22. Altmetric Badge
    Chapter 21 Single-Parameter Combinatorial Auctions with Partially Public Valuations
  23. Altmetric Badge
    Chapter 22 On the Efficiency of Markets with Two-Sided Proportional Allocation Mechanisms
  24. Altmetric Badge
    Chapter 23 Braess’s Paradox for Flows over Time
  25. Altmetric Badge
    Chapter 24 The Price of Anarchy in Network Creation Games Is (Mostly) Constant
  26. Altmetric Badge
    Chapter 25 Truthful Fair Division
  27. Altmetric Badge
    Chapter 26 No Regret Learning in Oligopolies: Cournot vs. Bertrand
  28. Altmetric Badge
    Chapter 27 On the Complexity of Pareto-optimal Nash and Strong Equilibria
  29. Altmetric Badge
    Chapter 28 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
  30. Altmetric Badge
    Chapter 29 On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games
  31. Altmetric Badge
    Chapter 30 Minimal Subsidies in Expense Sharing Games
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (90th percentile)
  • High Attention Score compared to outputs of the same age and source (96th percentile)

Mentioned by

blogs
2 blogs
wikipedia
6 Wikipedia pages

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 Mendeley
Summary Blogs Wikipedia Dimensions citations
So far, Altmetric has seen 6 citations on 6 Wikipedia pages.

This page shows the most recent Wikipedia articles that mention this research output.

Click here to find out how to access more activity, including 2 additional Wikipedia articles.

This page is provided by Altmetric.