Can Almost Everybody be Almost Happy?

DOI10.1145/2840728.2840731zbMath1335.91021OpenAlexW2293755438MaRDI QIDQ2800547

Yakov Babichenko, Aviad Rubinstein, Christos H. Papadimitriou

Publication date: 15 April 2016

Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2840728.2840731

zbMATH Keywords

Nash equilibriumhardness of approximationPCPPPAD

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) 2-person games (91A05) Other game-theoretic models (91A40)

Related Items (5)

Inapproximability of Nash Equilibrium ⋮ Communication complexity of approximate Nash equilibria ⋮ Public Bayesian persuasion: being almost optimal and almost persuasive ⋮ Inapproximability results for constrained approximate Nash equilibria ⋮ Unnamed Item

This page was built for publication: Can Almost Everybody be Almost Happy?