Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2307.08827 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918091840028672 |
|---|---|
| author | Leme, Renato Paes Schneider, Jon Shang, Heyang Zheng, Shuran |
| author_facet | Leme, Renato Paes Schneider, Jon Shang, Heyang Zheng, Shuran |
| contents | We initiate the study of Bayesian conversations, which model interactive communication between two strategic agents without a mediator. We compare this to communication through a mediator and investigate the settings in which a mediation can expand the range of implementable outcomes.
We look into the eventual outcome of two-player games after interactive communication. We focus on games where only one agent has a non-trivial action and examine the performance of communication protocols that are individually rational (IR) for both parties. We characterize the structure of the social-welfare optimal protocol of a given number of rounds and thus show a separation between Bayesian conversation and mediated protocols. We demonstrate an example where the optimal conversation protocol requires infinitely many rounds of communication, and further show that for settings with binary actions and binary types, any optimal protocol either is finite (with at most 6 rounds) or requires infinitely many rounds of communication. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2307_08827 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Bayesian Conversations Leme, Renato Paes Schneider, Jon Shang, Heyang Zheng, Shuran Computer Science and Game Theory We initiate the study of Bayesian conversations, which model interactive communication between two strategic agents without a mediator. We compare this to communication through a mediator and investigate the settings in which a mediation can expand the range of implementable outcomes. We look into the eventual outcome of two-player games after interactive communication. We focus on games where only one agent has a non-trivial action and examine the performance of communication protocols that are individually rational (IR) for both parties. We characterize the structure of the social-welfare optimal protocol of a given number of rounds and thus show a separation between Bayesian conversation and mediated protocols. We demonstrate an example where the optimal conversation protocol requires infinitely many rounds of communication, and further show that for settings with binary actions and binary types, any optimal protocol either is finite (with at most 6 rounds) or requires infinitely many rounds of communication. |
| title | Bayesian Conversations |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2307.08827 |