Maximizing an interval order on compact subsets of its domain

DOI10.1016/J.MATHSOCSCI.2008.01.003zbMATH Open1142.91405OpenAlexW2068398583MaRDI QIDQ943582FDOQ943582

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

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

zbMATH Keywords

interval ordersemiordermaximal elementpath independenceoutcast axiom

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Maximal elements of weakly continuous relations
• Utility Maximization, Choice and Preference
• Title not available (Why is that?)
• Maximal elements of acyclic relations on compact sets
• Maximality with or without binariness: transfer-type characterizations
• On the existence of maximal elements
• On the Existence of Most-Preferred Alternatives
• Potential games: A purely ordinal approach
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the existence of maximal elements: An impossibility theorem
• Maximal elements of non-binary choice functions on compact sets
• Title not available (Why is that?)
• The Existence of Choice Functions

Cited In (10)

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

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)