Can almost everybody be almost happy?

DOI10.1145/2840728.2840731zbMATH Open1335.91021OpenAlexW2293755438MaRDI QIDQ2800547FDOQ2800547

Christos Papadimitriou, Yakov Babichenko, Aviad Rubinstein

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

Recommendations

• Inapproximability of Nash equilibrium
• Inapproximability of Nash equilibrium
• scientific article; zbMATH DE number 6783488
• Settling the complexity of computing two-player Nash equilibria
• On the complexity of approximating a Nash equilibrium

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)

Cited In (6)

• Communication complexity of approximate Nash equilibria
• Title not available (Why is that?)
• Public Bayesian persuasion: being almost optimal and almost persuasive
• Inapproximability results for constrained approximate Nash equilibria
• Inapproximability of Nash Equilibrium
• Title not available (Why is that?)

This page was built for publication: Can almost everybody be almost happy?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800547)