Integer and combinatorial optimization
Integer and combinatorial optimization
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Super Arrovian Domains with Strict Preferences
SIAM Journal on Discrete Mathematics
The Geometry of Fractional Stable Matchings and its Applications
Mathematics of Operations Research
| Hi-index | 0.00 |
We formulate the problem of deciding which preference domains admit a non-dictatorial Arrovian Social Welfare Function as one of verifying the feasibility of an integer linear program. Many of the known results about the presence or absence of Arrovian social welfare functions, impossibility theorems in social choice theory, and properties of majority rule etc., can be derived in a simple and unified way from this integer program. We characterize those preference domains that admit a non-dictatorial, neutral Arrovian social welfare Function and give a polyhedral characterization of Arrovian social welfare functions on singlepeaked domains.