相关论文: The Fairness of Redistricting Ghost

Why not have a computer just draw a map? This is something you hear a lot when people talk about gerrymandering, and it's easy to think at first that this could solve redistricting altogether. But there are more than a couple problems with…

We develop a theory of distributive competition under redistricting that explains both electoral outcomes and the equilibrium allocation of policy benefits by endogenizing voter pivotality. In a multi-district model with primaries, general…

In this work the properties of multi choice minority games are studied by means of extensive computational simulations. We have considered several ways of rewarding the strategies of the players and compared the resulting behaviours of the…

Voting can abstractly model any decision-making scenario and as such it has been extensively studied over the decades. Recently, the related literature has focused on quantifying the impact of utilizing only limited information in the…

Minority game is a model of heterogeneous players who think inductively. In this game, each player chooses one out of two alternatives every turn and those who end up in the minority side wins. It is instructive to extend the minority game…

The process of drawing electoral district boundaries is known as political redistricting. Within this context, gerrymandering is the practice of drawing these boundaries such that they unfairly favor a particular political party, often…

Consider an election where N seats are distributed among parties with proportions p_1,...,p_m of the votes. We study, for the common divisor and quota methods, the asymptotic distribution, and in particular the mean, of the seat excess of a…

We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have additive values for the goods. The prior distributions on those…

The American winner-take-all congressional district system empowers politicians to engineer electoral outcomes by manipulating district boundaries. Existing computational solutions mostly focus on drawing unbiased maps by ignoring political…

We create 4200 synthetic cities which vary in percent minority population and their residential segregation patterns. Of these, 1200 are modeled on existing cities, and 3000 are rectangular grid cities. In each city, we consider…

Gerrymandering is a practice of manipulating district boundaries and locations in order to achieve a political advantage for a particular party. Lewenberg, Lev, and Rosenschein [AAMAS 2017] initiated the algorithmic study of a…

Redistricting is the problem of dividing a state into a number $k$ of regions, called districts. Voters in each district elect a representative. The primary criteria are: each district is connected, district populations are equal (or nearly…

In this paper, we study fairness in committee selection problems. We consider a general notion of fairness via stability: A committee is stable if no coalition of voters can deviate and choose a committee of proportional size, so that all…

In this paper, we apply techniques of ensemble analysis to understand the political baseline for Congressional representation in Colorado. We generate a large random sample of reasonable redistricting plans and determine the partisan…

Clustering is an unsupervised learning task that aims to partition data into a set of clusters. In many applications, these clusters correspond to real-world constructs (e.g. electoral districts) whose benefit can only be attained by groups…

As granular data about elections and voters become available, redistricting simulation methods are playing an increasingly important role when legislatures adopt redistricting plans and courts determine their legality. These simulation…

Teams frequently compete on multiple fronts: political parties contest districts for majority control, contractors field specialized units to win procurement contracts, and squads play match by match for titles. Although the prize accrues…

Several measures of partisan bias are reviewed for single member districts with two dominant parties. These include variants of the simple bias that considers only deviation of seats from 50% at statewide 50% vote. Also included are…

We consider multiplayer stochastic games in which the payoff of each player is a bounded and Borel-measurable function of the infinite play. By using a generalization of the technique of Martin (1998) and Maitra and Sudderth (1998), we show…

In mix-game which is an extension of minority game, there are two groups of agents; group1 plays the majority game, but the group2 plays the minority game. This paper studies the change of the average winnings of agents and volatilities vs.…