Sigle Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information

Susan Athey

Working papers from Massachusetts Institute of Technology (MIT), Department of Economics

Abstract: This paper derives sufficient conditions for a class of games of complete information , such as first price auctions, to have pure trategy Nash equilibria (PSNE). The paper treats games between two or more heterogeneous agents, each with private information about his own type (for example, a bidder's value for an object or a firm's marginal cost of production) , and the types are drawn from an atomless joint probability distribution which potentially allows for correlation between types.

Keywords: GAME THEORY; INFORMATION; ECONOMIC EQUILIBRIUM; AUCTIONS; PRICING (search for similar items in EconPapers)
JEL-codes: C62 C63 D44 D82 (search for similar items in EconPapers)
Pages: 50 pages
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
Journal Article: Single Crossing Properties and the Existence of Pure Strategy Equilibria in Games of Incomplete Information (2001)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:mit:worpap:97-11

Ordering information: This working paper can be ordered from
MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), DEPARTMENT OF ECONOMICS, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA

Access Statistics for this paper

More papers in Working papers from Massachusetts Institute of Technology (MIT), Department of Economics MASSACHUSETTS INSTITUTE OF TECHNOLOGY (MIT), DEPARTMENT OF ECONOMICS, 50 MEMORIAL DRIVE CAMBRIDGE MASSACHUSETTS 02142 USA. Contact information at EDIRC.
Bibliographic data for series maintained by Linda Woodbury ( this e-mail address is bad, please contact ).