 Small Verifiability in Long-Term RelationshipsNo CIRJE-F-98, CIRJE F-Series from CIRJE, Faculty of Economics, University of Tokyo Abstract: 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. Pages: 39 pages Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:tky:fseres:2000cf98 Access Statistics for this paper More papers in CIRJE F-Series from CIRJE, Faculty of Economics, University of Tokyo Contact information at EDIRC. |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.