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...

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...

We provide a respecification of an integer program characterization of Arrovian social welfare functions introduced by Sethuranam et al.(2003). By exploiting this respecification, we give a new and simpler proof of Theorem 2 in Kalai and Muller (1977).