Related papers: An Axiomatic Characterization of Split Cycle
Social Choice theory generalizes voting on one proposal to ranking multiple proposals. Yet, while a vote on a single proposal has the status quo (Reality) as a default, Reality has been forsaken during this generalization. Here, we propose…
In the committee voting setting, a subset of $k$ alternatives is selected based on the preferences of voters. In this paper, our goal is to efficiently compute $\textit{ex-ante}$ fair probability distributions over committees. We introduce…
We investigate majority rule dynamics in a population with two classes of people, each with two opinion states $\pm 1$, and with tunable interactions between people in different classes. In an update, a randomly selected group adopts the…
We build simple models for the distribution of voting patterns in a group, using the Supreme Court of the United States as an example. The least structured, or maximum entropy, model that is consistent with the observed pairwise…
In the context of computational social choice, we study voting methods that assign a set of winners to each profile of voter preferences. A voting method satisfies the property of positive involvement (PI) if for any election in which a…
The splitting principle states that morphisms in a derived category do not "split" accidentally. This has been successsfully applied in several characterizations of rational, DB, and other singularities. In this article I prove a general…
Competition between varying ideas, people and institutions fuels the dynamics of socio-economic systems. Numerous analyses of the empirical data extracted from different financial markets have established a consistent set of stylized facts…
Hybrid systems have steadily grown in popularity over the last few decades because they ease the task of modeling complicated nonlinear systems. Legged locomotion, robotic manipulation, and additive manufacturing are representative examples…
We develop an algorithm for model selection which allows for the consideration of a combinatorially large number of candidate models governing a dynamical system. The innovation circumvents a disadvantage of standard model selection which…
We introduce River, a novel Condorcet-consistent voting method that is based on pairwise majority margins and can be seen as a simplified variation of Tideman's Ranked Pairs method. River is simple to explain, simple to compute even 'by…
We introduce CUT, the class of 2-player partition games. These are NIM type games, played on a finite number of heaps of beans. The rules are given by a set of positive integers, which specifies the number of allowed splits a player can…
Machine learning algorithms aim at minimizing the number of false decisions and increasing the accuracy of predictions. However, the high predictive power of advanced algorithms comes at the costs of transparency. State-of-the-art methods,…
This work is devoted to examining qualitative properties of dynamic systems, in particular, limit cycles of stochastic differential equations with both rapid switching and small diffusion. The systems are featured by multi-scale…
Like many other voting systems, Majority Judgement suffers from the weaknesses of the underlying mathematical model: Elections as problem of choice or ranking. We show how the model can be enhanced to take into account the complete process…
Sequential voting rules have played a crucial role in shaping decisions within parliamentary and legislative frameworks. After observing that the existing sequential rules fail several fundamental axioms, Horan and Sprumont [2022] proposed…
Although randomization has long been used in distributed computing, formal methods for reasoning about probabilistic concurrent programs have lagged behind. No existing program logics can express specifications about the full distributions…
We take an axiomatic approach to study redistribution problems when agents report income and needs. We formalize axioms reflecting ethical and operational principles such as additivity, impartiality and individual rationality. Different…
We study several questions in the reliable agnostic learning framework of Kalai et al. (2009), which captures learning tasks in which one type of error is costlier than others. A positive reliable classifier is one that makes no false…
Arrow's Impossibility Theorem establishes bounds on what we can require from voting systems. Given satisfaction of a small collection of "fairness" axioms, it shows votes can only exist as dictatorships in which one voter determines all…
We study two concepts of proportionality in the model of approval-based committee elections. In degressive proportionality small minorities of voters are favored in comparison with the standard linear proportionality. Regressive…