Integer Programming and Arrovian Social Welfare Functions

DOI10.1287/MOOR.28.2.309.14478MaRDI QIDQ5704128zbMATH OpenOpenAlexFDO

Authors Jay Sethuraman, Teo Chung-Piaw, Rakesh V. Vohra

Publication date 11 November 2005

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL http://www.kellogg.northwestern.edu/research/math/papers/1316.pdf, http://hdl.handle.net/10419/221670

zbMATH Keywords

impossibility theoremlinear programmingsingle-peaked domainSocial welfare function

Mathematics Subject Classification ID

Integer programming (90C10) Voting theory (91B12) Social choice (91B14)

Recommendations

• Integer programming and arrovian social welfare functions
• A STUDY ON LINEAR INEQUALITY REPRESENTATION OF SOCIAL WELFARE FUNCTIONS(<Special Issue>Operations Research for Performance Evaluation)
• Kalai and Muller's possibility theorem: a simplified integer programming version
• Anonymous monotonic social welfare functions
• Simple majority rule and integer programming

Cited in

(10)

• Entry regulation and social welfare with an integer problem.
• Simple majority rule and integer programming
• Kalai and Muller's possibility theorem: a simplified integer programming version
• Anonymous monotonic social welfare functions
• Arrow's possibility theorem for one-dimensional single-peaked preferences
• A STUDY ON LINEAR INEQUALITY REPRESENTATION OF SOCIAL WELFARE FUNCTIONS(<Special Issue>Operations Research for Performance Evaluation)
• Integer programming and arrovian social welfare functions
• Ordinal simplicity in discrete mechanism design
• Oligarchies in spatial environments
• Decomposing random mechanisms

This page was built for publication: Integer Programming and Arrovian Social Welfare Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704128)