Please use this identifier to cite or link to this item:
|Title:||Integer programming and Arrovian Social Welfare Functions|
|Citation:||Sethuraman, J.,Teo, C.-P.,Vohra, R.V. (2002). Integer programming and Arrovian Social Welfare Functions. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2337 LNCS : 194-211. ScholarBank@NUS Repository.|
|Abstract:||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. © 2002 Springer-Verlag Berlin Heidelberg.|
|Source Title:||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.