Search
Now showing items 121-126 of 126
Uncovered choice functions
(2010-01-16)
An abiding problem in choice theory has been one of characterizing those choice function which are obtained as a result of some kind of optimization. Specifically, the endeavour has concentrated largely on finding a binary ...
Axiomatic characterizations of some solutions for abstract games
(2010-01-16)
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 ...
"On diversity and freedom of choice" a technical comment
(2010-01-18)
In this paper we show that the similarity based preference for freedom of choice defined by Pattanaik and Xu (2000), can be uniquely characterized by Indifference Between No-Choice Situation, Strong Monotonicity with respect ...
Vote aggregators : some axiomatic characterizations
(2010-01-18)
In this paper a model for the aggregation of ballot profiles is considered. In this framework three new results are obtained: the characterization of oligarchic aggregators, the characterization of the plurality aggregator ...
Local social decision functions: a survey
(2010-01-18)
In Aleskerov (1999) can be found a property that social decision functions are required to satisfy. This property is called locality. In Arrowzs original work it was called independence of irrelevant alternatives. Social ...
Top cycle and uncovered solutions for abstract games: axiomatic characterizations
(2010-01-18)
In this paper we consider binary relations which are reflexive and complete. Such binary relations are referred to in the literature as abstract games. Given an abstract game a (game)solution is a function which associates ...