↓ 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 Liquid Price of Anarchy
  3. Altmetric Badge
    Chapter 2 Tight Welfare Guarantees for Pure Nash Equilibria of the Uniform Price Auction
  4. Altmetric Badge
    Chapter 3 Online Random Sampling for Budgeted Settings
  5. Altmetric Badge
    Chapter 4 Liquid Welfare Maximization in Auctions with Multiple Items
  6. Altmetric Badge
    Chapter 5 On the Nucleolus of Shortest Path Games
  7. Altmetric Badge
    Chapter 6 Earning Limits in Fisher Markets with Spending-Constraint Utilities
  8. Altmetric Badge
    Chapter 7 Robustness Among Multiwinner Voting Rules
  9. Altmetric Badge
    Chapter 8 Computing Constrained Approximate Equilibria in Polymatrix Games
  10. Altmetric Badge
    Chapter 9 Group Activity Selection on Graphs: Parameterized Analysis
  11. Altmetric Badge
    Chapter 10 The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games
  12. Altmetric Badge
    Chapter 11 Conditional Value-at-Risk: Structure and Complexity of Equilibria
  13. Altmetric Badge
    Chapter 12 Reconciling Selfish Routing with Social Good
  14. Altmetric Badge
    Chapter 13 Selfish Network Creation with Non-uniform Edge Cost
  15. Altmetric Badge
    Chapter 14 Opinion Formation Games with Aggregation and Negative Influence
  16. Altmetric Badge
    Chapter 15 The Efficiency of Best-Response Dynamics
  17. Altmetric Badge
    Chapter 16 Efficient Best Response Computation for Strategic Network Formation Under Attack
  18. Altmetric Badge
    Chapter 17 Path Deviations Outperform Approximate Stability in Heterogeneous Congestion Games
  19. Altmetric Badge
    Chapter 18 Agent Incentives of Strategic Behavior in Resource Exchange
  20. Altmetric Badge
    Chapter 19 A 3-Player Protocol Preventing Persistence in Strategic Contention with Limited Feedback
  21. Altmetric Badge
    Chapter 20 Hedging Under Uncertainty: Regret Minimization Meets Exponentially Fast Convergence
  22. Altmetric Badge
    Chapter 21 Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching
  23. Altmetric Badge
    Chapter 22 Group Strategyproof Pareto-Stable Marriage with Indifferences via the Generalized Assignment Game
  24. Altmetric Badge
    Chapter 23 The Spectrum of Equilibria for the Colonel Blotto and the Colonel Lotto Games
  25. Altmetric Badge
    Chapter 24 On Proportional Allocation in Hedonic Games
  26. Altmetric Badge
    Chapter 25 Stable Marriage with Covering Constraints–A Complete Computational Trichotomy
  27. Altmetric Badge
    Chapter 26 Fairly Allocating Contiguous Blocks of Indivisible Items
Attention for Chapter 21: Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 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.
Chapter title
Tradeoffs Between Information and Ordinal Approximation for Bipartite Matching
Chapter number 21
Book title
Algorithmic Game Theory
Published by
Springer, Cham, September 2017
DOI 10.1007/978-3-319-66700-3_21
Book ISBNs
978-3-31-966699-0, 978-3-31-966700-3
Authors

Elliot Anshelevich, Wennan Zhu, Anshelevich, Elliot, Zhu, Wennan