Implementing Mediators with Asynchronous Cheap Talk

DOI10.1145/3293611.3331623MaRDI QIDQ5145262zbMATH OpenOpenAlexFDO

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

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

distributed computinggame theorysecurity

Mathematics Subject Classification ID

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

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

Cited in

(4)

• Data curation from privacy-aware agents
• Security in Asynchronous Interactive Systems
• Communication games, sequential equilibrium, and mediators
• Lower bounds on implementing mediators in asynchronous systems with rational and malicious agents

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)