Making choices with a binary relation: relative choice axioms and transitive closures

DOI10.1016/J.EJOR.2010.05.009zbMATH Open1205.91053OpenAlexW2128499951MaRDI QIDQ992691FDOQ992691

Authors: Rémy-Robert Joseph 

Publication date: 9 September 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.05.009

Recommendations

• scientific article; zbMATH DE number 4068558
• On the construction of non-empty choice sets
• Choice of best alternatives on directed graphs and tournaments
• Choosing among maximals
• Transitive closure, proximity and intransitivities

zbMATH Keywords

digraphsocial choice theorymultiple criteria analysisbest choicetop-cycle

Mathematics Subject Classification ID

Decision theory (91B06) Social choice (91B14)

Cites Work

• Title not available (Why is that?)
• Ordinal regression revisited: Multiple criteria ranking using a set of additive value functions
• Title not available (Why is that?)
• Multiple criteria decision analysis. State of the art surveys
• Title not available (Why is that?)
• Semiorders and a Theory of Utility Discrimination
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Schwartz's rule
• Intransitive indifference with unequal indifference intervals
• Title not available (Why is that?)
• Title not available (Why is that?)
• Robustness in operational research and decision aiding: a multi-faceted issue
• Tentative guidelines to help choosing an appropriate MCDA method
• Building a set of additive value functions representing a reference preorder and intensities of preference: GRIP method
• Title not available (Why is that?)
• Sequential composition of voting rules in multi-issue domains
• Title not available (Why is that?)
• Maximization and the Act of Choice
• An axiomatic analysis of concordance-discordance relations
• Sets of alternatives as Condorcet winners
• The Computational Complexity of Choice Sets
• A systematic approach to the construction of non-empty choice sets
• A survey on the complexity of tournament solutions
• Multicriteria decision support using rules that represent rough-graded preference relations
• Axiomatic characterization of a general utility function and its particular cases in terms of conjoint measurement and rough-set decision rules
• Condorcet choice correspondences for weak tournaments
• Title not available (Why is that?)
• Kernels of Preference Structures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Choosing among maximals
• Condorcet choice correspondences: A set-theoretical comparison
• Choice functions: Rationality re-examined
• Decision-support with preference constraints
• Condorcet choice functions and maximal elements
• Title not available (Why is that?)

Cited In (5)

• On the construction of non-empty choice sets
• Title not available (Why is that?)
• Non-dominance and potential optimality for partial preference relations
• Choices and kernels in bipolar valued digraphs
• Transitive closure, proximity and intransitivities

Uses Software

• CP-nets
• VisualUTA

This page was built for publication: Making choices with a binary relation: relative choice axioms and transitive closures

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