Affirmative Action Policy and Effort Levels. Sequential-Move Contest Game Argument

In this paper we analyse a simple two-person sequential-move contest game with heterogeneous players. Assuming that the heterogeneity could be the consequence of past discrimination, we study the effects of implementation of affirmative action policy, which tackles this heterogeneity by compensating discriminated players, and compare them with the situation in which the heterogeneity is ignored and the contestants are treated equally. In our analysis we consider different orders of moves. We show that the order of moves of contestants is a very important factor in determination of the effects of the implementation of the affirmative action policy. We also prove that in such cases a significant role is played by the level of the heterogeneity of individuals. In particular, in contrast to the present-in-the-literature predictions, we demonstrate that as a consequence of the interplay of these two factors, the response to the implementation of the affirmative action policy option may be the decrease in the total equilibrium effort level of the contestants in comparison to the unbiased contest game.

Nondictatorial Arrovian Social Welfare Functions: An Integer Programming Approach

In the line opened by Kalai and Muller (1997), we explore new conditions on prefernce domains which make it possible to avoid Arrow's impossibility result. In our main theorem, we provide a complete characterization of the domains admitting nondictorial Arrovian social welfare functions with ties (i.e. including indifference in the range) by introducing a notion of strict decomposability. In the proof, we use integer programming tools, following an approach first applied to social choice theory by Sethuraman, Teo and Vohra ((2003), (2006)). In order to obtain a representation of Arrovian social welfare functions whose range can include indifference, we generalize Sethuraman et al.'s work and specify integer programs in which variables are allowed to assume values in the set {0, 1/2, 1}: indeed, we show that, there exists a one-to-one correspondence between solutions of an integer program defined on this set and the set of all Arrovian social welfare functions - without restrictions on the range.

Integer Programming on Domains Containing Inseparable Ordered Paris

Using the integer programming approach introduced by Sethuraman, Teo, and Vohra (2003), we extend the analysis of the preference domains containing an inseparable ordered pair, initiated by Kalai and Ritz (1978). We show that these domains admit not only Arrovian social welfare functions \without ties," but also Arrovian social welfare functions \with ties," since they satisfy the strictly decomposability condition introduced by Busetto, Codognato, and Tonin (2012). Moreover, we go further in the comparison between Kalai and Ritz (1978)'s inseparability and Arrow (1963)'s single-peak restrictions, showing that the former condition is more \respectable," in the sense of Muller and Satterthwaite (1985).