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
In [10], Kalai investigated the probability of a rational outcome for a generalized social welfare f...
This paper addresses the problem of constructing a group cardinal social welfare function whose argu...
In this paper I investigate the properties of social welfare functions defined on domains where the ...
We characterize the class of Arrovian Social Welfare Functions as integer solutions to a collection...
We formulate the problem of deciding which preference domains admit a non-dictatorial Arrovian Socia...
In the line opened by Kalai and Muller (J Econ Theory 16:457–469, 1977), we explore new conditions o...
Following Sethuraman, Teo and Vohra ((2003), (2006)), we ap- ply integer programming tools to the an...
Using the integer programming approach introduced by Sethuraman, Teo, and Vohra (2003), we extend th...
This paper presents a study on the recently proposed linear inequality representation of Arrovian So...
In this paper, we use a respecified and simplified version of an integer program characterization of...
In this paper, we use the linear programming approach to mechanism design, first introduced by Sethu...
Using the integer programming approach introduced by Sethuraman, Teo, and Vohra (2003), we extend th...
Using the integer programming approach introduced by Sethuraman, Teo, and Vohra (2003), we extend th...
This paper examines the implications for social welfare functions of restricting the domain of indiv...
We provide a respecification of an integer programming characterization of Arrovian social welfare f...
In [10], Kalai investigated the probability of a rational outcome for a generalized social welfare f...
This paper addresses the problem of constructing a group cardinal social welfare function whose argu...
In this paper I investigate the properties of social welfare functions defined on domains where the ...
We characterize the class of Arrovian Social Welfare Functions as integer solutions to a collection...
We formulate the problem of deciding which preference domains admit a non-dictatorial Arrovian Socia...
In the line opened by Kalai and Muller (J Econ Theory 16:457–469, 1977), we explore new conditions o...
Following Sethuraman, Teo and Vohra ((2003), (2006)), we ap- ply integer programming tools to the an...
Using the integer programming approach introduced by Sethuraman, Teo, and Vohra (2003), we extend th...
This paper presents a study on the recently proposed linear inequality representation of Arrovian So...
In this paper, we use a respecified and simplified version of an integer program characterization of...
In this paper, we use the linear programming approach to mechanism design, first introduced by Sethu...
Using the integer programming approach introduced by Sethuraman, Teo, and Vohra (2003), we extend th...
Using the integer programming approach introduced by Sethuraman, Teo, and Vohra (2003), we extend th...
This paper examines the implications for social welfare functions of restricting the domain of indiv...
We provide a respecification of an integer programming characterization of Arrovian social welfare f...
In [10], Kalai investigated the probability of a rational outcome for a generalized social welfare f...
This paper addresses the problem of constructing a group cardinal social welfare function whose argu...
In this paper I investigate the properties of social welfare functions defined on domains where the ...