Mechanism design in large games: incentives and privacy

@article{Kearns2014MechanismDI,
  title={Mechanism design in large games: incentives and privacy},
  author={M. Kearns and M. Pai and A. Roth and J. Ullman},
  journal={ArXiv},
  year={2014},
  volume={abs/1207.4084}
}
  • M. Kearns, M. Pai, +1 author J. Ullman
  • Published 2014
  • Computer Science, Mathematics
  • ArXiv
  • We study the problem of implementing equilibria of complete information games in settings of incomplete information, and address this problem using "recommender mechanisms." A recommender mechanism is one that does not have the power to enforce outcomes or to force participation, rather it only has the power to suggestion outcomes on the basis of voluntary participation. We show that despite these restrictions, recommender mechanisms can implement equilibria of complete information games in… CONTINUE READING
    62 Citations

    Topics from this paper.

    Paper Mentions

    Privacy and Truthful Equilibrium Selection for Aggregative Games
    • 24
    • PDF
    Asymptotically truthful equilibrium selection in large congestion games
    • 34
    • PDF
    Inducing Approximately Optimal Flow Using Truthful Mediators
    • 18
    • PDF
    A Differential Privacy Incentive Compatible Mechanism and Equilibrium Analysis
    • Hai Liu, Z. Wu, Lin Zhang
    • Computer Science
    • 2016 International Conference on Networking and Network Applications (NaNA)
    • 2016
    • 1
    An Antifolk Theorem for Large Repeated Games
    • 6
    Privacy-Preserving Public Information for Sequential Games
    • 11
    • PDF
    Logarithmic Query Complexity for Approximate Nash Computation in Large Games
    • 2
    • PDF
    Private Pareto Optimal Exchange
    • 7
    • PDF
    Private Pareto Optimal Exchange
    • 3
    Privacy and mechanism design
    • 57
    • PDF

    References

    Lower Bounds in Differential Privacy
    • A. De
    • Computer Science, Mathematics
    • TCC
    • 2012
    • 95
    • Highly Influential
    • PDF