Dichotomous Preferences and Power Set Extensions

This paper is devoted to the study of how to extend a dichotomous partition of a universal set X into good and bad objects to an ordering on the power set of X. We introduce a family of rules that naturally take into account the number of good objects and the number of bad objects, and provide axiomatic characterizations of two rules for ranking sets in such a context

Dichotomous Preferences and Power Set Extensions

This paper is devoted to the study of how to extend a dichotomous partition of a universal set X into good and bad objects to an ordering on the power set of X. We introduce a family of rules that naturally take into account the number of good objects and the number of bad objects, and provide axiomatic characterizations of two rules for ranking sets in such a context.dichotomy; objects; set extensions; ranking sets

Stable Roommate Problem with Diversity Preferences

In the multidimensional stable roommate problem, agents have to be allocated to rooms and have preferences over sets of potential roommates. We study the complexity of finding good allocations of agents to rooms under the assumption that agents have diversity preferences [Bredereck et al., 2019]: each agent belongs to one of the two types (e.g., juniors and seniors, artists and engineers), and agents' preferences over rooms depend solely on the fraction of agents of their own type among their potential roommates. We consider various solution concepts for this setting, such as core and exchange stability, Pareto optimality and envy-freeness. On the negative side, we prove that envy-free, core stable or (strongly) exchange stable outcomes may fail to exist and that the associated decision problems are NP-complete. On the positive side, we show that these problems are in FPT with respect to the room size, which is not the case for the general stable roommate problem. Moreover, for the classic setting with rooms of size two, we present a linear-time algorithm that computes an outcome that is core and exchange stable as well as Pareto optimal. Many of our results for the stable roommate problem extend to the stable marriage problem.Comment: accepted to IJCAI'2

Preferences, actions and voting rules

In this paper we address several issues related to collective dichotomous decision-making by means of quaternary voting rules, i.e., when voters may choose between four actions: voting yes, voting no, abstaining and not turning up - which are aggregated by a voting rule into a dichotomous decision: acceptance or rejection of a proposal. In particular we study the links between the actions and preferences of the actors. We show that quaternary rules (unlike binary rules, where only two actions -yes or no- are possible) leave room for manipulability (i.e., strategic behaviour). Thus a preference profile does not in general determine an action profile. We also deal with the notions of success and decisiveness and their ex ante assessment for quaternary voting rules, and discuss the role of information and coordination in this context.

Boolean Hedonic Games

We study hedonic games with dichotomous preferences. Hedonic games are cooperative games in which players desire to form coalitions, but only care about the makeup of the coalitions of which they are members; they are indifferent about the makeup of other coalitions. The assumption of dichotomous preferences means that, additionally, each player's preference relation partitions the set of coalitions of which that player is a member into just two equivalence classes: satisfactory and unsatisfactory. A player is indifferent between satisfactory coalitions, and is indifferent between unsatisfactory coalitions, but strictly prefers any satisfactory coalition over any unsatisfactory coalition. We develop a succinct representation for such games, in which each player's preference relation is represented by a propositional formula. We show how solution concepts for hedonic games with dichotomous preferences are characterised by propositional formulas.Comment: This paper was orally presented at the Eleventh Conference on Logic and the Foundations of Game and Decision Theory (LOFT 2014) in Bergen, Norway, July 27-30, 201

Quaternary dichotomous voting rules

In this paper we provide a general model of "quaternary" dichotomous voting rules (QVRs), namely, voting rules for making collective dichotomous decisions (to accept or reject a proposal), based on vote profiles in which four options are available to each voter: voting ("yes", "no" or "abstaining") or staying home and not turning out. The model covers most of actual real-world dichotomus rules, where quorums are often required, and some of the extensions considered in the literature. In particular, we address and solve the question of the representability of QVRs by means of weighted rules and extend the notion of "dimension" of a rule.

Good and Bad Objects: Cardinality-Based Rules

We consider the problem of ranking sets of objects, the members of which are mutually compatible.Assuming that each object is either good or bad, we axiomatically characterize three cardinality-based rules which arise naturally in this dichotomous setting.They are what we call the symmetric difference rule, the lexicographic good-bad rule, and the lexicographic bad-good rule.Each of these rules induces a unique additive separable preference relation over the set of all groups of objects.welfare economics;ranking