Search
Now showing items 121-130 of 169
Consequence of chernoff and outcasting
(2009-12-12)
The purpose of this paper is to prove by induction the theorem (in Aizerman and Malishevsi [1981]) that a choice function which satisfies Chernoff s axiom and Outcasting can always by expressed as the union of the solution ...
The equal loss choice function revisited
(2009-12-12)
Choice theory is a mathematical discipline which studies the problem of choosing a point from a set of points by studying the mathematical properties of maps assigning an outcome to each choice problem in some class of ...
A note on numerical representations of quasi-transitive binary relations
(2009-12-12)
A Binary relation is said to be quasi-transitive if its asymmetric part is transitive. A binary relation is said to be a weak-order if it is reflexive, complete and transitive. One may refer to Frensh [1986] for a synopsis ...
Rational choice correspondence in social choice problems
(2009-12-12)
This paper grew out of a reading of an interesting exposition by Danilov and Sotskov [1997], where general one to one correspondences are established between binary relations and choice correspondences. Out purpose in this ...
Theorem in utility theory revisited
(2009-12-12)
We provide in this paper a simple proof of the proposition that comparability of first differences of utility implies cardinality when the range of the utility function is a connected subset of the reals.
Extended partial orders: a note
(2009-12-12)
The purpose of this paper is to establish the equivalence of two axioms one of which appear in Nehring [1997] and the other in Nehring and Puppe [1999]. The one in Nehring and Puppe [1999] is due to Aizerman and Malishevski ...
Zorn's Lemma in rational choice theory: a note
(2009-12-12)
The first significant use of Zorn s Lemma in rational choice theory is in the paper by Szpilrajin(1930), where it is established that every strict partial order can be embedded within a strict linear order. Subsequently, ...
Some solutions for abstract games: axiomatic characterisations
(2009-12-14)
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 ...
Axiomatic analysis of vote aggregators
(2010-01-16)
In this paper a model for the aggregation of ballot profiles is considered. In this framework some new results are obtained: the characterization of oligarchic aggregators, the characterization of the plurality aggregator ...
Axiomatic characterization of indirect utility and lexicographic extensions
(2010-01-16)
The general problem we are interested in this paper is of the following variety: We are given a finite universal set and a linear ordering on it. What is the minimal axiomatic characterization of particular extension of ...