CaltechAUTHORS
  A Caltech Library Service

Communication and equilibrium in discontinuous games of incomplete information

Jackson, Matthew O. and Simon, Leo K. and Swinkels, Jeroen M. and Zame, William R. (2002) Communication and equilibrium in discontinuous games of incomplete information. Econometrica, 70 (5). pp. 1711-1740. ISSN 0012-9682. https://resolver.caltech.edu/CaltechAUTHORS:JACe02

[img]
Preview
PDF - Published Version
See Usage Policy.

209Kb
[img]
Preview
PDF - Erratum
See Usage Policy.

47Kb

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:JACe02

Abstract

This paper offers a new approach to the study of economic problems usually modeled as games of incomplete information with discontinuous payoffs. Typically, the discontinuities arise from indeterminacies (ties) in the underlying problem. The point of view taken here is that the tie-breaking rules that resolve these indeterminacies should be viewed as part of the solution rather than part of the description of the model. A solution is therefore a tie-breaking rule together with strategies satisfying the usual best-response criterion. When information is incomplete, solutions need not exist; that is, there may be no tie-breaking rule that is compatible with the existence of strategy profiles satisfying the usual best-response criteria. It is shown that the introduction of incentive compatible communication (cheap talk) restores existence.


Item Type:Article
Related URLs:
URLURL TypeDescription
http://dx.doi.org/10.1111/1468-0262.00351 DOIUNSPECIFIED
http://onlinelibrary.wiley.com/doi/10.1111/1468-0262.00351/abstractPublisherUNSPECIFIED
ORCID:
AuthorORCID
Jackson, Matthew O.0000-0001-9846-4249
Additional Information:© 2002 The Econometric Society. Manuscript received June, 2001; final revision received January, 2002. This paper merges “Cheap Talk and Discontinuous Games of Incomplete Information,” by Simon and Zame, and “Existence of Equilibrium in Auctions and Discontinuous Bayesian Games: Endogenous and Incentive Compatible Sharing Rules,” by Jackson and Swinkels. We are grateful for comments from Kim Border, Martin Cripps, Bryan Ellickson, Preston McAfee, Roger Myerson, John Nachbar, Phil Reny, John Riley, Larry Samuelson, Mark Satterthwaite, Tianxiang Ye, seminar audiences at Minnesota, Northwestern, Rochester, Stanford, the Stony Brook Game Theory Conference, Texas, UCLA, and UCSD. We especially thank a co-editor and three referees for helpful comments. Jackson is grateful for financial support from the National Science Foundation. Zame is grateful for the hospitality of the UC Berkeley Economics Department in Winter 1996, when much of this work was done, and for financial support from the Ford Foundation, from the National Science Foundation, and from the UCLA Academic Senate Committee on Research. Swinkels thanks the Boeing Center for Technology, Information, and Manufacturing for financial support.
Subject Keywords:Auctions, cheap talk, discontinuous games, sharing rules, tie-breaking rules
Issue or Number:5
Record Number:CaltechAUTHORS:JACe02
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:JACe02
Alternative URL:http://www.jstor.org/cgi-bin/jstor/viewitem/00129682/sp030002/03x0020t/0?searchUrl=http%3a//www.jstor.org/search/BasicResults%3fhp%3d25%26si%3d1%26Query%3daa%253A%2522Matthew%2bO.%2bJackson%253B%2bLeo%2bK.%2bSimon%253B%2bJeroen%2bM.%2bSwinkels%253B%2bWill
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:4812
Collection:CaltechAUTHORS
Deposited By: Lindsay Cleary
Deposited On:08 Sep 2006
Last Modified:02 Oct 2019 23:16

Repository Staff Only: item control page