Related papers: In elections, irrelevant alternatives provide rele…
We consider a model where a subset of candidates must be selected based on voter preferences, subject to general constraints that specify which subsets are feasible. This model generalizes committee elections with diversity constraints,…
Classical results in voting theory show that strategic manipulation by voters is inevitable if a voting rule simultaneously satisfy certain desirable properties. Motivated by this, we study the relevant question of how often a voting rule…
We provide a sharp identification region for discrete choice models where consumers' preferences are not necessarily complete even if only aggregate choice data is available. Behavior is modeled using an upper and a lower utility for each…
I study the optimal voting mechanism for a committee that must decide whether to enact or block a policy of unknown benefit. Information can come both from committee members who can acquire it at cost, and a strategic lobbyist who wishes…
Impartial selection problems are concerned with the selection of one or more agents from a set based on mutual nominations from within the set. To avoid strategic nominations of the agents, the axiom of impartiality requires that the…
Misleading or unnecessary data can have out-sized impacts on the health or accuracy of Machine Learning (ML) models. We present a Bayesian sequential selection method, akin to Bayesian experimental design, that identifies critically…
AWAIRE is one of two extant methods for conducting risk-limiting audits of instant-runoff voting (IRV) elections. In principle AWAIRE can audit IRV contests with any number of candidates, but the original implementation incurred memory and…
Teddy Seidenfeld has been arguing for quite a long time that binary preference models are not powerful enough to deal with a number of crucial aspects of imprecision and indeterminacy in uncertain inference and decision making. It is at his…
In this paper, we study voting rules on the interval domain, where the alternatives are arranged according to an externally given strict total order and voters report intervals of this order to indicate the alternatives they support. For…
A set of $2^n$ candidates is presented to a commission. At every round, each member of this commission votes by pairwise comparison, and one-half of the candidates is deleted from the tournament, the remaining ones proceeding to the next…
In decision support systems the motivation and justification of the system's diagnosis or classification is crucial for the acceptance of the system by the human user. In Bayesian networks a diagnosis or classification is typically…
Data-based decisionmaking must account for the manipulation of data by agents who are aware of how decisions are being made and want to affect their allocations. We study a framework in which, due to such manipulation, data becomes less…
Artificial Intelligence and Machine Learning are becoming increasingly present in several aspects of human life, especially, those dealing with decision making. Many of these algorithmic decisions are taken without human supervision and…
We study the parameterized control complexity of fallback voting, a voting system that combines preference-based with approval voting. Electoral control is one of many different ways for an external agent to tamper with the outcome of an…
To select a subset of samples or "winners" from a population of candidates, order sampling [Rosen 1997] and the k-unit Myerson auction [Myerson 1981] share a common scheme: assign a (random) score to each candidate, then select the k…
Deep learning is renowned for its theory-practice gap, whereby principled theory typically fails to provide much beneficial guidance for implementation in practice. This has been highlighted recently by the benign overfitting phenomenon:…
Plurality and approval voting are two well-known voting systems with different strengths and weaknesses. In this paper we consider a new voting system we call beta(k) which allows voters to select a single first-choice candidate and approve…
Scoring protocols are a broad class of voting systems. Each is defined by a vector $(\alpha_1,\alpha_2,...,\alpha_m)$, $\alpha_1 \geq \alpha_2 \geq >... \geq \alpha_m$, of integers such that each voter contributes $\alpha_1$ points to…
We study a two-alternative voting game where voters' preferences depend on an unobservable world state and each voter receives a private signal correlated to the true world state. We consider the collective decision when voters can…
AI systems are often used to make or contribute to important decisions in a growing range of applications, including criminal justice, hiring, and medicine. Since these decisions impact human lives, it is important that the AI systems act…