Strengthening Nash Equilibria (2312.14745v2)
Abstract: Nash equilibrium is often heralded as a guiding principle for rational decision-making in strategic interactions. However, it is well-known that Nash equilibrium sometimes fails as a reliable predictor of outcomes, with two of the most notable issues being the fact that it is not resilient to collusion and that there may be multiple Nash equilibria in a single game. In this paper, we show that a mechanism designer can get around these two issues for free by expanding the action sets of the original game. More precisely, given a normal-form or Bayesian game $\Gamma$ and a Nash equilibrium $\vec{\sigma}$ in $\Gamma$, a mechanism designer can construct a new game $\Gamma{\vec{\sigma}}$ by expanding the action set of each player and defining appropriate utilities in the action profiles that were not already in the original game. We show that the designer can construct $\Gamma{\vec{\sigma}}$ in such a way that (a) $\vec{\sigma}$ is a semi-strong Nash equilibrium of $\Gamma{\vec{\sigma}}$, and (b) $\vec{\sigma}$ Pareto-dominates or quasi Pareto-dominates all other Nash equilibria of $\Gamma{\vec{\sigma}}$.
- Distributed computing meets game theory: combining insights from two fields. Acm Sigact News, 42(2):69–76, 2011.
- Implementing mediators with asynchronous cheap talk. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pages 501–510, 2019.
- Distributed computing meets game theory: robust mechanisms for rational secret sharing and multiparty computation. In Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, pages 53–62, 2006.
- Lower bounds on implementing robust and resilient mediators. In Theory of Cryptography: Fifth Theory of Cryptography Conference, TCC 2008, New York, USA, March 19-21, 2008. Proceedings 5, pages 302–319. Springer, 2008.
- Bar fault tolerance for cooperative services. In Proceedings of the twentieth ACM symposium on Operating systems principles, pages 45–58, 2005.
- Robert J Aumann. Acceptable points in general cooperative n-person games. Contributions to the Theory of Games, 4:287–324, 1959.
- Robert J Aumann. Subjectivity and correlation in randomized strategies. Journal of mathematical Economics, 1(1):67–96, 1974.
- Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th ACM Symposium on Theory of Computing, pages 1–10, 1988.
- Michael Ben-Or. Another advantage of free choice (extended abstract) completely asynchronous agreement protocols. In Proceedings of the second annual ACM symposium on Principles of distributed computing, pages 27–30, 1983.
- Asynchronous secure computation. In Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 52–61, 1993.
- Coalition-proof nash equilibria i. concepts. Journal of economic theory, 42(1):1–12, 1987.
- Gabriel Bracha. An asynchronous [(n-1)/3]-resilient consensus protocol. In Proceedings of the third annual ACM symposium on Principles of distributed computing, pages 154–162, 1984.
- Asynchronous consensus and broadcast protocols. Journal of the ACM (JACM), 32(4):824–840, 1985.
- Francoise Forges. An approach to communication equilibria. Econometrica: Journal of the Econometric Society, pages 1375–1385, 1986.
- Security in asynchronous interactive systems. In International Symposium on Stabilizing, Safety, and Security of Distributed Systems, pages 123–140. Springer, 2021.
- Communication games, sequential equilibrium, and mediators. arXiv preprint, arXiv:2309.14618, 2023.
- Lower bounds on implementing mediators in asynchronous systems with rational and malicious agents. Journal of the ACM, 70(2):1–21, 2023.
- k-implementation. In Proceedings of the 4th ACM conference on Electronic Commerce, pages 19–28, 2003.
- Strong mediated equilibrium. Artificial Intelligence, 173(1):180–195, 2009.
- Similarity-based cooperation. arXiv preprint, arXiv:2211.14468, 2022.
- Congestion games with failures. In Proceedings of the 6th ACM Conference on Electronic Commerce, pages 259–268, 2005.
- Michael O Rabin. Randomized byzantine generals. In 24th annual symposium on foundations of computer science (sfcs 1983), pages 403–409. IEEE, 1983.
- Rational agreement in the presence of crash faults. In 2021 IEEE International Conference on Blockchain, pages 470–475. IEEE, 2021.
- Moshe Tennenholtz. Program equilibrium. Games and Economic Behavior, 49(2):363–373, 2004.
- N-party bar transfer. In Proceedings of the 2011 Conference on Principles of Distributed Systems, pages 392–408. Springer, 2011.