Responsive set extension
In utility theory, the responsive set (RS) extension is an extension of a preference-relation on individual items, to a partial preference-relation of item-bundles.
Example
Suppose there are four items: . A person states that he ranks the items according to the following total order:
(i.e., z is his best item, then y, then x, then w). Assuming the items are independent goods, one can deduce that:
- – the person prefers his two best items to his two worst items;
- – the person prefers his best and third-best items to his second-best and fourth-best items.
But, one cannot deduce anything about the bundles ; we do not know which of them the person prefers.
The RS extension of the ranking is a partial order on the bundles of items, that includes all relations that can be deduced from the item-ranking and the independence assumption.
Definitions
Let be a set of objects and a total order on .
The RS extension of is a partial order on . It can be defined in several equivalent ways.[1]
Responsive set (RS)
The original RS extension[2]: 44–48 is constructed as follows. For every bundle , every item and every item , take the following relations:
- (- adding an item improves the bundle)
- If then (- replacing an item with a better item improves the bundle).
The RS extension is the transitive closure of these relations.
Pairwise dominance (PD)
The PD extension is based on a pairing of the items in one bundle with the items in the other bundle.
Formally, if-and-only-if there exists an Injective function from to such that, for each , .
Stochastic dominance (SD)
The SD extension (named after stochastic dominance) is defined not only on discrete bundles but also on fractional bundles (bundles that contains fractions of items). Informally, a bundle Y is SD-preferred to a bundle X if, for each item z, the bundle Y contains at least as many objects, that are at least as good as z, as the bundle X.
Formally, iff, for every item :
where is the fraction of item in the bundle .
If the bundles are discrete, the definition has a simpler form. iff, for every item :
Additive utility (AU)
The AU extension is based on the notion of an additive utility function.
Many different utility functions are compatible with a given ordering. For example, the order is compatible with the following utility functions:
Assuming the items are independent, the utility function on bundles is additive, so the utility of a bundle is the sum of the utilities of its items, for example:
The bundle has less utility than according to both utility functions. Moreover, for every utility function compatible with the above ranking:
- .
In contrast, the utility of the bundle can be either less or more than the utility of .
This motivates the following definition:
iff, for every additive utility function compatible with :
Equivalence
- implies .[1]
- and are equivalent.[1]
- implies . Proof: If , then there is an injection such that, for all , . Therefore, for every utility function compatible with , . Therefore, if is additive, then .[1]
- It is known that and are equivalent, see e.g.[3]
Therefore, the four extensions and and and are all equivalent.
Responsiveness
A total order on bundles is called responsive[4]: 287–288 if it is contains the responsive-set-extension of some total order on items.
Responsiveness is implied by additivity, but not vice versa:
- If a total order is additive (represented by an additive function) then by definition it contains the AU extension , which is equivalent to , so it is responsive.
- On the other hand, a total order may responsive but not additive: it may contain the AU extension which is consistent with all additive functions, but may also contain other relations that are inconsistent with a single additive function.
See also
References
- ^ a b c d Aziz, Haris; Gaspers, Serge; MacKenzie, Simon; Walsh, Toby (2015). "Fair assignment of indivisible objects under ordinal preferences". Artificial Intelligence. 227: 71. arXiv:1312.6546. doi:10.1016/j.artint.2015.06.002.
- ^ Barberà, S., Bossert, W., Pattanaik, P. K. (2004). "Ranking sets of objects.". Handbook of utility theory (PDF). Springer US.
{{cite book}}
: CS1 maint: multiple names: authors list (link) - ^ Katta, Akshay-Kumar; Sethuraman, Jay (2006). "A solution to the random assignment problem on the full preference domain". Journal of Economic Theory. 131 (1): 231. doi:10.1016/j.jet.2005.05.001.
- ^ Brandt, Felix; Conitzer, Vincent; Endriss, Ulle; Lang, Jérôme; Procaccia, Ariel D. (2016). Handbook of Computational Social Choice. Cambridge University Press. ISBN 9781107060432. (free online version)