Nash equilibrium in games with incomplete preferences
Sophie Bade ()
Economic Theory, 2005, vol. 26, issue 2, 309-332
Abstract:
This paper investigates Nash equilibrium under the possibility that preferences may be incomplete. I characterize the Nash-equilibrium-set of such a game as the union of the Nash-equilibrium-sets of certain derived games with complete preferences. These games with complete preferences can be derived from the original game by a simple linear procedure, provided that preferences admit a concave vector-representation. These theorems extend some results on finite games by Shapley and Aumann. The applicability of the theoretical results is illustrated with examples from oligopolistic theory, where firms are modelled to aim at maximizing both profits and sales (and thus have multiple objectives). Mixed strategy and trembling hand perfect equilibria are also discussed. Copyright Springer-Verlag Berlin/Heidelberg 2005
Keywords: Incomplete preferences; Nash equilibrium; multi-objective programming; Cournot Equilibrium. (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations: View citations in EconPapers (42)
Downloads: (external link)
http://hdl.handle.net/10.1007/s00199-004-0541-1 (text/html)
Access to full text is restricted to subscribers.
Related works:
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:spr:joecth:v:26:y:2005:i:2:p:309-332
Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/199/PS2
DOI: 10.1007/s00199-004-0541-1
Access Statistics for this article
Economic Theory is currently edited by Nichoals Yanneils
More articles in Economic Theory from Springer, Society for the Advancement of Economic Theory (SAET) Contact information at EDIRC.
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().