Bargaining mechanisms for one-way games (Q1651808): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2526274173 / rank | |||
Normal rank |
Revision as of 00:17, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bargaining mechanisms for one-way games |
scientific article |
Statements
Bargaining mechanisms for one-way games (English)
0 references
10 July 2018
0 references
Summary: We introduce one-way games, a two-player framework whose distinguishable feature is that the private payoff of one (independent) player is determined only by her own strategy and does not depend on the actions taken by the other (dependent) player. We show that the equilibrium outcome in one-way games without side payments and the social cost of any ex post efficient mechanism can be far from the optimum. We also show that it is impossible to design a Bayes-Nash incentive-compatible mechanism for one-way games that is budget-balanced, individually rational and efficient. To address this negative result, we propose a privacy-preserving mechanism based on a single-offer bargaining made by the dependent player that leverages the intrinsic advantage of the independent player. In this setting the outside option of the dependent player is not known a priori; however, we show that the mechanism satisfies individual rationality conditions, is incentive-compatible, budget-balanced and produces an outcome that is more efficient than the equilibrium without payments. Finally, we show that a randomized multi-offer extension brings no additional benefit in terms of efficiency.
0 references
bargaining
0 references
mechanism design
0 references
price of anarchy
0 references
distributed problem solving
0 references