Binary interactions and subset choice

DOI10.1016/0377-2217(95)00073-9zbMath0912.90001OpenAlexW2075185921WikidataQ126400864 ScholiaQ126400864MaRDI QIDQ1268247

Peter C. Fishburn, Irving H. La Valle

Publication date: 18 October 1998

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

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00073-9

zbMATH Keywords

choice problemsbinary-interaction modelsubset evaluationsubset-choice problems

Mathematics Subject Classification ID

Decision theory (91B06) Abstract computational complexity for mathematical programming problems (90C60) Utility theory (91B16) Individual preferences (91B08)

Related Items (8)

Ordinal optimization through multi-objective reformulation ⋮ Using atomic bounds to get sub-modular approximations ⋮ A characterization of the existence of succinct linear representation of subset-valuations ⋮ Intractability and approximation of optimization theories of cognition ⋮ Sources of complexity in subset choice ⋮ Set choice problems with incomplete information about the preferences of the decision maker ⋮ Modeling action-interdependence in multiple criteria decision making ⋮ Signed orders, choice probabilities, and linear polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the extension of an order on a set to the power set
• An axiomatic characterization of the lexicographic maximin extension of an ordering over a set to the power set
• Interval orders and circle orders
• On the extension of preferences over a set to the power set: An axiomatic characterization of a quasi-ordering
• Signed orders and power set extensions
• Approximation algorithms for combinatorial problems
• Manipulation of social choice functions
• Subset preferences in linear and nonlinear utility theory
• Cardinal admissibility and optimability in finite nonarchimedean decision theory
• Interdependent preferences on finite sets
• Even-chance lotteries in social choice theory
• A Methodology for Collective Evaluation and Selection of Industrial R&D Projects
• Voting by Committees
• On the Maximum Weight Clique Problem
• A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
• Utility as an Additive Set Function
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• An Approximate Measure of Value
• An Axiomatic Approach to Measurable Utility

This page was built for publication: Binary interactions and subset choice