Perfect implementation
From MaRDI portal
Publication:625041
DOI10.1016/J.GEB.2010.05.003zbMATH Open1205.91038OpenAlexW4250821943MaRDI QIDQ625041FDOQ625041
Authors: Sergei Izmalkov, Matt Lepinski, Silvio Micali 
Publication date: 11 February 2011
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.geb.2010.05.003
Recommendations
Cites Work
- Long Cheap Talk
- Computational Complexity and Communication: Coordination in Two-Player Games
- The knowledge complexity of interactive proof-systems
- Computational Complexity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verifiably Secure Devices
- Unmediated communication in games with complete and incomplete information.
- Universal Mechanisms
- Cheap talk in games with incomplete information.
- Fair Distribution Protocols or How the Players Replace Fortune
- Communication in games of incomplete information: Two players
- Correlation without mediation: Expanding the set of equilibrium outcomes by ``cheap pre-play procedures
- Sequential equilibria in Bayesian games with communication
Cited In (6)
- Incentive compatibility and strategy-proofness of mechanisms of organizational behavior control: retrospective, state of the art, and prospects of theoretical research
- One-step-ahead implementation
- A Compiler of Two-Party Protocols for Composable and Game-Theoretic Security, and Its Application to Oblivious Transfer
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions
- Communication with tokens in repeated games on networks
- Exact implementation
This page was built for publication: Perfect implementation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625041)
