vix.ing · top · new · best · stats · spec

On Unconditionally Secure Multiparty Computation for Realizing Correlated Equilibria in Games

2013/11/06 by Ye Wang, Wang, Ye, Shantanu Rane +3
Decision Sciences · Economics, Econometrics and Finance · Physics and Astronomy · #Computer Science and Game Theory (cs.GT) #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Game Theory and Applications #Game Theory and Voting Systems #Information Theory (cs.IT) #Opinion Dynamics and Social Influence

paper · pdf · doi:10.48550/arxiv.1311.1490

openalex publication_date 2013/11/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In game theory, a trusted mediator acting on behalf of the players can enable the attainment of correlated equilibria, which may provide better payoffs than those available from the Nash equilibria alone. We explore the approach of replacing the trusted mediator with an unconditionally secure sampling protocol that jointly generates the players' actions. We characterize the joint distributions that can be securely sampled by malicious players via protocols using error-free communication. This class of distributions depends on whether players may speak simultaneously ("cheap talk") or must speak in turn ("polite talk"). In applying sampling protocols toward attaining correlated equilibria with rational players, we observe that security against malicious parties may be much stronger than necessary. We propose the concept of secure sampling by rational players, and show that many more distributions are feasible given certain utility functions. However, the payoffs attainable via secure sampling by malicious players are a dominant subset of the rationally attainable payoffs.

Related