Please use this identifier to cite or link to this item:
http://hdl.handle.net/11718/772
Title: | Axiomatic characterizations of some solutions for abstract games |
Authors: | Lahiri, Somdeb |
Keywords: | Choice theory;Axiomatic - Characterization |
Issue Date: | 16-Jan-2010 |
Series/Report no.: | WP;2000-02-02/1580 |
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]. More recently, the emphasis has focused on binary relations defined on non-empty subsets of a given set, such that the choice function coincides with the best subset corresponding to a feasible set of alternatives. This problem has been provided with a solution in Lahiri [1999], although the idea of binary relations defined on subsets is a concept which owes its analytical origins to Pattanaik and Xu [1990]. |
URI: | http://hdl.handle.net/11718/772 |
Appears in Collections: | Working Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
WP 2000_1580.pdf | 669.04 kB | Adobe PDF | View/Open |
Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.