Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/44003
| Title: | Integer programming and arrovian social welfare functions | Authors: | Sethuraman, J. Piaw, T.C. Vohra, R.V. |
Keywords: | Impossibility theorem Linear programming Single-peaked domain Social welfare function |
Issue Date: | 2003 | Citation: | Sethuraman, J.,Piaw, T.C.,Vohra, R.V. (2003). Integer programming and arrovian social welfare functions. Mathematics of Operations Research 28 (2) : 309-326. ScholarBank@NUS Repository. | 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. | Source Title: | Mathematics of Operations Research | URI: | http://scholarbank.nus.edu.sg/handle/10635/44003 | ISSN: | 0364765X |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.