MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Reputation without commitment in finitely repeated games

Author(s)
Weinstein, Jonathan; Yildiz, Muhamet
Thumbnail
DownloadYildiz_Reputation without.pdf (275Kb)
PUBLISHER_CC

Publisher with Creative Commons License

Creative Commons Attribution

Terms of use
Creative Commons Attribution Non-Commercial License http://creativecommons.org/licenses/by-nc/3.0/
Metadata
Show full item record
Abstract
In the reputation literature, players have commitment types, which represent the possibility that they do not have standard payoffs, but instead are constrained to follow a particular plan. In this paper, we show that arbitrary commitment types can emerge from incomplete information about the stage payoffs. In particular, any finitely repeated game with commitment types is strategically equivalent to a standard finitely repeated game with incomplete information about the stage payoffs. Then classic reputation results can be achieved with uncertainty concerning only the stage payoffs.
Date issued
2016-01
URI
http://hdl.handle.net/1721.1/104059
Department
Massachusetts Institute of Technology. Department of Economics
Journal
Theoretical Economics
Publisher
John Wiley & Sons
Citation
Weinstein, Jonathan, and Muhamet Yildiz. "Reputation without commitment in finitely repeated games." Theoretical Economics 11 (2016), 157-185.
Version: Final published version
ISSN
19336837

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.