Maximizing an interval order on compact subsets of its domain

DOI10.1016/J.MATHSOCSCI.2008.01.003MaRDI QIDQ943582zbMATH OpenOpenAlexFDO

Authors Nikolai S. Kukushkin

Publication date 10 September 2008

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mathsocsci.2008.01.003

zbMATH Keywords

interval ordersemiordermaximal elementpath independenceoutcast axiom

Mathematics Subject Classification ID

Decision theory (91B06) Rationality and learning in game theory (91A26)

Recommendations

• Maximal elements of weakly continuous relations
• Maximal elements for irreflexive binary relations on compact sets
• Maximality with or without binariness: transfer-type characterizations
• Maximal elements of non-binary choice functions on compact sets
• General interval choice mechanisms and the functions generated by them

Cites work

• scientific article; zbMATH DE number 3139280 (Why is no real title available?)
• scientific article; zbMATH DE number 3877239 (Why is no real title available?)
• scientific article; zbMATH DE number 3711700 (Why is no real title available?)
• scientific article; zbMATH DE number 1275270 (Why is no real title available?)
• scientific article; zbMATH DE number 194358 (Why is no real title available?)
• scientific article; zbMATH DE number 3227613 (Why is no real title available?)
• scientific article; zbMATH DE number 3255437 (Why is no real title available?)
• scientific article; zbMATH DE number 3361657 (Why is no real title available?)
• scientific article; zbMATH DE number 3400720 (Why is no real title available?)
• Maximal elements of acyclic relations on compact sets
• Maximal elements of non-binary choice functions on compact sets
• Maximal elements of weakly continuous relations
• Maximality with or without binariness: transfer-type characterizations
• On the Existence of Most-Preferred Alternatives
• On the existence of maximal elements
• On the existence of maximal elements: An impossibility theorem
• Potential games: A purely ordinal approach
• The Existence of Choice Functions
• Utility Maximization, Choice and Preference

Cited in

(10)

• The single crossing conditions for incomplete preferences
• Cournot tatonnement and potentials
• General interval choice mechanisms and the functions generated by them
• Properties of a choice function generated by a binary relation on convex subsets
• Maximizing a preference relation on complete chains and lattices
• Cournot tatonnement in aggregative games with monotone best responses
• A unified view of the existence of maximals
• Strong Nash equilibrium in games with common and complementary local utilities
• On the existence of optima in complete chains and lattices
• Representations of Preference Relations with Preutility Functions on Metric Spaces

This page was built for publication: Maximizing an interval order on compact subsets of its domain

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q943582)