Integer programming and arrovian social welfare functions

Authors:
Jay Sethuraman;Teo Chung Piaw;Rakesh V. Vohra
Affiliations:
Department of Industrial Engineering and Operations Research, Columbia University, New York, New York;Department of Decision Sciences, National University of Singapore, Singapore 119260;Department of Managerial Economics and Decision Sciences, Kellogg Graduate School of Management, Northwestern University, Evanston, Illinois
Venue:
Mathematics of Operations Research
Year:
2003

Citing 1
Cited 1

The Geometry of Fractional Stable Matchings and its Applications

Mathematics of Operations Research

A Technique for Large Automated Mechanism Design Problems

IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We characterize the class of Arrovian Social Welfare Functions (ASWFs) as integer solutions to a collection of linear inequalities. Many of the classical possibility, impossibility, and characterization results can be derived in a simple and unified way from this integer program. Among the new results we derive is a characterization of preference domains that admit a nondictatorial, neutral ASWF. We also give a polyhedral characterization of all ASWFs on single-peaked domains.