Integer programming and arrovian social welfare functions

Please use this identifier to cite or link to this item: https://scholarbank.nus.edu.sg/handle/10635/44003

DC Field	Value
dc.title	Integer programming and arrovian social welfare functions
dc.contributor.author	Sethuraman, J.
dc.contributor.author	Piaw, T.C.
dc.contributor.author	Vohra, R.V.
dc.date.accessioned	2013-10-09T03:24:23Z
dc.date.available	2013-10-09T03:24:23Z
dc.date.issued	2003
dc.identifier.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.
dc.identifier.issn	0364765X
dc.identifier.uri	http://scholarbank.nus.edu.sg/handle/10635/44003
dc.description.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.
dc.source	Scopus
dc.subject	Impossibility theorem
dc.subject	Linear programming
dc.subject	Single-peaked domain
dc.subject	Social welfare function
dc.type	Article
dc.contributor.department	DECISION SCIENCES
dc.description.sourcetitle	Mathematics of Operations Research
dc.description.volume	28
dc.description.issue	2
dc.description.page	309-326
dc.description.coden	MORED
dc.identifier.isiut	NOT_IN_WOS
Appears in Collections:	Staff Publications

There are no files associated with this item.

Check