Abstract Games Admitting Stable Solutions

Somdeb Lahiri

No WP2000-02-01, IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

Abstract: An abiding problem in choice theory has been one of characterizing those choice functions which are obtained as a result of some kind of optimization. Specifically, the endeavour has concentrated largely on finding a binary relation (if there be any) whose best elements coincide with observed choices. An adequate survey of this line of research till the mid eighties is available in Moulin [1985]. The idea of a function which associates with each set and a binary relation a non-empty subset of the given set has a long history whose exact origin is very difficult to specify and in any case is unknown to the author. In Laslier [1997] can be found a very exhaustive survey of the related theory when binary relations are reflexive, complete and anti-symmetric.

Date: 2000-02-01
References: Add references at CitEc
Citations:

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

Related works:
Working Paper: Abstract Games Admitting Stable Solutions (2000)
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:iim:iimawp:wp01660

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().