Implementing Mediators with Asynchronous Cheap Talk

DOI10.1145/3293611.3331623OpenAlexW2963731586MaRDI QIDQ5145262FDOQ5145262

Ivan Geffner, Joseph Y. Halpern, Danny Dolev, Ittai Abraham

Publication date: 20 January 2021

Published in: Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.01214

zbMATH Keywords

game theorydistributed computingsecurity

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (3)

• Security in Asynchronous Interactive Systems
• Data curation from privacy-aware agents
• Communication games, sequential equilibrium, and mediators

   Recommendations

• Beneficial mediated communication in cheap talk 👍 👎
• Mediation: Incomplete information bargaining with filtered communication. 👍 👎
• Lower Bounds on Implementing Robust and Resilient Mediators 👍 👎
• Mediated talk: an experiment 👍 👎
• Mediation and the Nash bargaining solution 👍 👎
• Mediated talk 👍 👎
• Simultaneous-offers bargaining with a mediator 👍 👎
• Mediators in position auctions 👍 👎
• Mechanism Design with Strategic Mediators 👍 👎

This page was built for publication: Implementing Mediators with Asynchronous Cheap Talk

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145262)