↓ Skip to main content

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 Stable Matchings with Ties, Master Preference Lists, and Matroid Constraints
  3. Altmetric Badge
    Chapter 2 Algorithmic Game Theory
  4. Altmetric Badge
    Chapter 3 Pareto Optimal Matchings in Many-to-Many Markets with Ties
  5. Altmetric Badge
    Chapter 4 Cost-Sharing Models in Participatory Sensing
  6. Altmetric Badge
    Chapter 5 Further Results on Capacitated Network Design Games
  7. Altmetric Badge
    Chapter 6 Cost-Sharing Scheduling Games on Restricted Unrelated Machines
  8. Altmetric Badge
    Chapter 7 Efficient Money Burning in General Domains
  9. Altmetric Badge
    Chapter 8 Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Design
  10. Altmetric Badge
    Chapter 9 Equilibria of Plurality Voting: Lazy and Truth-Biased Voters
  11. Altmetric Badge
    Chapter 10 The Combinatorial World (of Auctions) According to GARP
  12. Altmetric Badge
    Chapter 11 Auction Design with a Revenue Target
  13. Altmetric Badge
    Chapter 12 Algorithmic Signaling of Features in Auction Design
  14. Altmetric Badge
    Chapter 13 On the Efficiency of the Proportional Allocation Mechanism for Divisible Resources
  15. Altmetric Badge
    Chapter 14 On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
  16. Altmetric Badge
    Chapter 15 Can Bandwidth Sharing Be Truthful?
  17. Altmetric Badge
    Chapter 16 The Web Graph as an Equilibrium
  18. Altmetric Badge
    Chapter 17 Excluding Braess’s Paradox in Nonatomic Selfish Routing
  19. Altmetric Badge
    Chapter 18 “Beat-Your-Rival” Routing Games
  20. Altmetric Badge
    Chapter 19 Characterization and Computation of Equilibria for Indivisible Goods
  21. Altmetric Badge
    Chapter 20 When Can Limited Randomness Be Used in Repeated Games?
  22. Altmetric Badge
    Chapter 21 Settling Some Open Problems on 2-Player Symmetric Nash Equilibria
  23. Altmetric Badge
    Chapter 22 Approximating Nash Equilibria in Tree Polymatrix Games
  24. Altmetric Badge
    Chapter 23 Commitment in First-Price Auctions
  25. Altmetric Badge
    Chapter 24 Brief Announcement: Effect of Strategic Grading and Early Offers in Matching Markets
  26. Altmetric Badge
    Chapter 25 Brief Announcement: New Mechanisms for Pairwise Kidney Exchange
  27. Altmetric Badge
    Chapter 26 Brief Announcement: On Effective Affirmative Action in School Choice
  28. Altmetric Badge
    Chapter 27 Brief Announcement: Resource Allocation Games with Multiple Resource Classes
  29. Altmetric Badge
    Chapter 28 Brief Announcement: On the Fair Subset Sum Problem
  30. Altmetric Badge
    Chapter 29 Brief Announcement: Computation of Fisher-Gale Equilibrium by Auction
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

patent
1 patent
wikipedia
2 Wikipedia pages

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
13 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
Algorithmic Game Theory
Published by
Springer, Berlin, Heidelberg, September 2015
DOI 10.1007/978-3-662-48433-3
ISBNs
978-3-66-248432-6, 978-3-66-248433-3
Editors

Martin Hoefer

Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 13 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
India 1 8%
Unknown 12 92%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 31%
Researcher 3 23%
Unspecified 2 15%
Student > Postgraduate 1 8%
Lecturer 1 8%
Other 2 15%
Readers by discipline Count As %
Computer Science 5 38%
Unspecified 2 15%
Economics, Econometrics and Finance 2 15%
Engineering 2 15%
Social Sciences 1 8%
Other 1 8%