A systematic approach to the construction of non-empty choice sets
From MaRDI portal
Publication:535405
DOI10.1007/S00355-006-0176-1zbMATH Open1211.91106OpenAlexW1990633040MaRDI QIDQ535405FDOQ535405
Authors: John Duggan
Publication date: 11 May 2011
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-006-0176-1
Recommendations
Cites Work
- Sophisticated voting outcomes and agenda control
- Condorcet Social Choice Functions
- A general extension theorem for binary relations
- General Possibility Theorems for Group Decisions
- Acyclic social choice from finite sets
- On the existence of maximal elements
- Choosing from a tournament
- Bounds for mixed strategy equilibria and the spatial model of elections
- From Arrow to cycles, instability, and chaos by untying alternatives
- Mixed refinements of Shapley's saddles and weak tournaments
- Social choice and electoral competition in the general spatial model
Cited In (14)
- A topological characterization of the non-emptiness of the banks set and the uncovered set
- The Condorcet set: majority voting over interconnected propositions
- Preference aggregation theory without acyclicity: the core without majority dissatisfaction
- On stable solutions to the ordinal social choice problem
- Uncovered sets
- On the construction of non-empty choice sets
- Preference-based choice functions: a generalized approach
- A topological characterization of the existence of non-empty choice sets
- Making choices with a binary relation: relative choice axioms and transitive closures
- Title not available (Why is that?)
- Dominating, weakly stable, and uncovered sets: properties and generalizations
- Modeling optimal social choice: matrix-vector representation of various solution concepts based on majority rule
- Common characterizations of the untrapped set and the top cycle
- Variable preference relations: existence of maximal elements
This page was built for publication: A systematic approach to the construction of non-empty choice sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q535405)