The computational complexity of rationalizing Pareto optimal choice behavior

We consider a setting where a coalition of individuals chooses one or several alternatives from each set in a collection of choice sets. We examine the computational complexity of Pareto rationalizability. Pareto rationalizability requires that we can endow each individual in the coalition with a preference relation such that the observed choices are Pareto efficient. We differentiate between the situation where the choice function is considered to select all Pareto optimal alternatives from a choice set and the situation where it only contains one or several Pareto optimal alternatives. In the former case we find that Pareto rationalizability is an NP-complete problem. For the latter case we demonstrate that, if we have no additional information on the individual preference relations, then all choice behavior is Pareto rationalizable. However, if we have such additional information, then Pareto rationalizability is again NP-complete. Our results are valid for any coalition of size greater or equal than two.

The computational complexity of rationalizing Pareto optimal choice behavior.

We consider a setting where a coalition of individuals chooses one or several alternatives from each set in a collection of choice sets. We examine the computational complexity of Pareto rationalizability. Pareto rationalizability requires that we can endow each individual in the coalition with a preference relation such that the observed choices are Pareto efficient. We differentiate between the situation where the choice function is considered to select all Pareto optimal alternatives from a choice set and the situation where it only contains one or several Pareto optimal alternatives. In the former case we find that Pareto rationalizability is an NP-complete problem. For the latter case we demonstrate that, if we have no additional information on the individual preference relations, then all choice behavior is Pareto rationalizable. However, if we have such additional information, then Pareto rationalizability is again NP-complete. Our results are valid for any coalition of size greater or equal than two.

Bargaining Multiple Issues with Leximin Preferences

Global bargaining problems over a finite number of different issues, are formalized as cartesian products of classical bargaining problems. For maximin and leximin bargainers we characterize global bargaining solutions that are efficient and satisfy the requirement that bargaining separately or globally leads to equivalent outcomes. Global solutions in this class are constructed from the family of monotone path solutions for classical bargaining problems.Global bargaining, maximin preferences, leximin preferences

Two Criteria for Social Decisions

This paper studies the ethical underpinnings of two social criteria which are prominent in the literature dealing with the problem of evaluating allocations of several consumption goods in a population with heteregenous preferences. The Pazner-Schmeidler criterion (Pazner-Schmeidler 1978) and the Walrasian criterion (Fleurbaey and Maniquet 1996) are prima facie quite different. But it is shown here that these criteria are related to close variants of the fairness condition that an allocation is better when every individual bundle in it dominates the average consumption in another allocation. In addition, the results suggest that the Pazner-Schmeidler criterion can be viewed as the best extension of the Walrasian criterion to non-convex economies.social welfare, social choice, fairness

Strong implementation with partially honest individuals

In this paper we provide sufficient conditions for a social choice rule to be implementable in strong Nash equilibrium in the presence of partially honest agents, that is, agents who break ties in favor of a truthful message when they face indifference between outcomes. In this way, we achieve a relaxation in the condition of Korpela (2013), namely the Axiom of Sufficient Reason. Our new condition, Weak Pareto Dominance, is shown to be sufficient along with Weak Pareto Optimality and Universally Worst Alternative. We finally provide applications of our result in pure matching and bargaining environments