Perfect implementation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4207454 (Why is no real title available?)
- scientific article; zbMATH DE number 1759774 (Why is no real title available?)
- Cheap talk in games with incomplete information.
- Communication in games of incomplete information: Two players
- Computational Complexity
- Computational Complexity and Communication: Coordination in Two-Player Games
- Correlation without mediation: Expanding the set of equilibrium outcomes by ``cheap pre-play procedures
- Fair Distribution Protocols or How the Players Replace Fortune
- Long Cheap Talk
- Sequential equilibria in Bayesian games with communication
- The knowledge complexity of interactive proof-systems
- Universal Mechanisms
- Unmediated communication in games with complete and incomplete information.
- Verifiably Secure Devices
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)