Choosing among maximals
From MaRDI portal
Given a preference, a choice consists of selecting a maximal element. However, in many situations, the set of maximal elements is not a singleton and a choice has to be eventually made among maximal elements. This can be done in a random way. But it is often possible to use the original preference to obtain additional information that can justify a selection among these maximal elements. The authors propose various selection methods based on this additional information, in particular a method based on a binary relation somewhat similar to the covering relation.
Recommendations
- A note on a property of maximal sets and choice in the absence of universal comparability
- A selection of maximal elements under non-transitive indifferences
- Maximal-element rationalizability
- Condorcet choice functions and maximal elements
- Maximality with or without binariness: transfer-type characterizations
Cites work
- Choice functions over a finite set: A summary
- Condorcet Social Choice Functions
- scientific article; zbMATH DE number 3877239 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- Intransitive indifference with unequal indifference intervals
- Semiorders and a Theory of Utility Discrimination
Cited in
(10)- Selective priorities in processing of big data
- Never choose the uniquely largest. A characterization
- On the existence of greatest elements and maximizers
- What to maximize if you must
- A unified view of the existence of maximals
- scientific article; zbMATH DE number 3920226 (Why is no real title available?)
- Maximization and the Act of Choice
- A selection of maximal elements under non-transitive indifferences
- Secure and perfect maximality
- Making choices with a binary relation: relative choice axioms and transitive closures
This page was built for publication: Choosing among maximals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q696933)
