Abstract games admitting stable solutions

dc.contributor.author	Lahiri, Somdeb
dc.date.accessioned	2010-01-16T11:12:49Z
dc.date.available	2010-01-16T11:12:49Z
dc.date.copyright	2000-02
dc.date.issued	2010-01-16T11:12:49Z
dc.identifier.uri	http://hdl.handle.net/11718/770
dc.description.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.	en
dc.language.iso	en	en
dc.relation.ispartofseries	WP;2000-02-01/1579
dc.subject	Choice theory	en
dc.title	Abstract games admitting stable solutions	en
dc.type	Working Paper	en