We study the problem of determining memberships to the groups in a Boolean algebra. The Boolean algebra is composed of basic groups (e.g., “J” and “K”) and the other groups that are derived from basic groups through the conjunction, disjunction, or negation operations (e.g., “J and...

In ordinal (probabilistic) assignment problems, each agent reports his preference rankings over objects and receives a lottery defined over those objects. A common efficiency notion, sd-efficiency, is obtained by extending the preference rankings to preferences over lotteries by means of...

We critically discuss the Jefferson/D'Hondt and Webster/Sainte-Laguë methods, which are used to allocate parliament seats to parties in the mixed-member proportional representation systems in Germany, New Zealand, Bolivia, South Africa, South Korea, Scotland and Wales, as well as in the...

This study investigates efficient and strategy‐proof mechanisms for allocating indivisible goods under constraints. First, we examine a setting without endowments. In this setting, we introduce a class of constraints-ordered accessibility-for which the serial dictatorship (SD) mechanism is...

This research examines the computational complexity of two boundedly rational choice models that use multiple rationales to explain observed choice behavior. First, we show that the notion of rationalizability by K rationales as introduced by Kalai, Rubinstein, and Spiegler (2002) is NP-complete...

This paper studies optimal task assignments in a setting where agents are expectation-based loss averse according to KoszegiRabin (2006) and KoszegiRabin (2007) and are compensated according to an aggregated performance measure in which tasks are technologically independent. We show that the...