A detail-free mediator
From MaRDI portal
Publication:2436299
Recommendations
- Unmediated communication in games with complete and incomplete information.
- Implementation of communication equilibria by correlated cheap talk: the two-player case
- Correlation and unmediated cheap talk in repeated games with imperfect monitoring
- Unmediated communication in repeated games with imperfect monitoring.
- Mediated talk
Cites work
- Cheap talk in games with incomplete information.
- Comparison of information structures
- Computational Complexity and Communication: Coordination in Two-Player Games
- Computationally restricted unmediated talk under incomplete information
- Correlation without mediation: Expanding the set of equilibrium outcomes by ``cheap pre-play procedures
- Distributed computing meets game theory
- Enumeration of Nash equilibria for two-player games
- Fair Distribution Protocols or How the Players Replace Fortune
- Implementation of communication equilibria by correlated cheap talk: the two-player case
- Internal correlation in repeated games
- Long Cheap Talk
- Lower Bounds on Implementing Robust and Resilient Mediators
- Mediated talk
- Mediation: Incomplete information bargaining with filtered communication.
- Minority-proof cheap-talk protocol
- One-shot public mediated talk
- Problems With Coordination in Two-Player Games: Comment on Computational Complexity and Communication
- Repeated communication through the mechanism \textit{and}
- Repeated games with incomplete information. With the collaboration of Richard E. Stearns
- Secure protocols of how communication generates correlation
- Subjectivity and correlation in randomized strategies
- Universal Mechanisms
- Unmediated communication in games with complete and incomplete information.
Cited in
(7)
This page was built for publication: A detail-free mediator
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2436299)