2024-03-28T21:43:22Z
https://repository.dl.itc.u-tokyo.ac.jp/oai
oai:repository.dl.itc.u-tokyo.ac.jp:00041970
2022-12-19T04:17:18Z
62:7433:7434
9:7435:7436
Small Verifiability in Long-Term Relationships
Matsushima, Hitoshi
96583
330
Finitely Repeated Games with Side Payments
Small Verifiability
Limited Liability
Unique Implementation
Efficiency
application/pdf
This paper investigates a finitely repeated game at the beginning of which players agree to write an explicit contract with full commitment. This contract conditions the budget-balancing vector of side payments on the complete history of their action choices. However, this history is not always verifiable to the court, and each player's liability is severely limited. We show, in the general case, that even if the probability of the complete history being verifiable is small and the amount of possible fines is negligible compared with the differences in long-run payoffs, every efficient payoff vector induced by an action profile, which Pareto-dominates a Nash equilibrium action profile, is uniquely and exactly implementable either in terms of perfect equilibrium or in terms of perfect iterative undominance. Moreover, we show, in a wide class of component games, that even if this probability is close to zero and the amount of fines is negligible compared with the differences not only in long-run payoffs but also in instantaneous payoffs, every efficient payoff vector induced by an action profile, which Pareto-dominates a Nash equilibrium action profile, is uniquely and virtually implementable either in terms of perfect equilibrium or in terms of perfect iterative undominance.
本文フィルはリンク先を参照のこと
technical report
日本経済国際共同センター
2000-12
Discussion paper series. CIRJE-F
CF-98
AA11450569
eng
http://www.cirje.e.u-tokyo.ac.jp/research/dp/2000/2000cf98.pdf
metadata only access