Cryptographic Implications for Artificially Mediated Games
Thomas Kellam Meyer

TL;DR
This paper explores how cryptographic protocols can replace trusted mediators in game theory to enable secure, private computation of correlated equilibria in non-cooperative games, broadening the applicability of such solutions.
Contribution
It introduces a cryptographic framework for implementing mediators in game theory, allowing secure computation of correlated equilibria without trusted third parties.
Findings
Cryptographic protocols can simulate mediators securely.
Players can compute correlated equilibria privately.
The approach extends game theory applications without trusted mediators.
Abstract
There is currently an intersection in the research of game theory and cryptography. Generally speaking, there are two aspects to this partnership. First there is the application of game theory to cryptography. Yet, the purpose of this paper is to focus on the second aspect, the converse of the first, the application of cryptography to game theory. Chiefly, there exist a branch of non-cooperative games which have a correlated equilibrium as their solution. These equilibria tend to be superior to the conventional Nash equilibria. The primary condition for a correlated equilibrium is the presence of a mediator within the game. This is simply a neutral and mutually trusted entity. It is the role of the mediator to make recommendations in terms of strategy profiles to all players, who then act (supposedly) on this advice. Each party privately provides the mediator with the necessary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGame Theory and Applications · Opinion Dynamics and Social Influence · Artificial Intelligence in Games
