相关论文: 3:1 Nesting Rules in Redistricting

The problem of finding optimal set of users for influencing others in the social network has been widely studied. Because it is NP-hard, some heuristics were proposed to find sub-optimal solutions. Still, one of the commonly used assumption…

The problem of how to allocate to states the seats in the US House of Representatives is the most studied instance of what is termed the `apportionment problem'. We propose a new method of apportionment which is stochastic, which meets the…

In this paper, we propose a new averaging model for modeling the competitive influence of $K$ candidates among $n$ voters in an election process. For such an influence propagation model, we address the question of how many seeded voters a…

When solving k-in-a-Row games, the Hales-Jewett pairing strategy [4] is a well-known strategy to prove that specific positions are (at most) a draw. It requires two empty squares per possible winning line (group) to be marked, i.e., with a…

In redistricting litigation, effective enforcement of the Voting Rights Act has often involved providing the court with districting plans that display a larger number of majority-minority districts than the current proposal (as was true,…

Single Transferable Vote (STV) is used to elect candidates to the 76 seat Australian Senate across six states and two territories. These eight STV contests are counted using a combination of ballot scanners, manual data entry and tabulation…

We study a process of opinion formation in a population of agents whose interaction pattern is defined on the basis of randomly distributed groups of three agents, or triplets -in contrast to networks, which are defined on the basis of…

This paper quantitatively analyzes county-level voting patterns in Wisconsin's presidential elections from 2000 to 2024. As a pivotal swing state, Wisconsin has alternated between Democratic and Republican candidates since 2012. Using data…

Gerrymandering is a pervasive problem within the US political system. In the past decade, methods based on Markov Chain Monte Carlo (MCMC) sampling and statistical outlier tests have been proposed to quantify gerrymandering and were used as…

Inspired by the word game Ghost, we propose a new protocol for bipartisan redistricting in which partisan players take turns assigning precincts to districts. We prove that in an idealized setting, if both parties have the same number…

We present results on the enumeration of crossings and nestings for matchings and set partitions. Using a bijection between partitions and vacillating tableaux, we show that if we fix the sets of minimal block elements and maximal block…

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…

The biological process of gene assembly has been modeled based on three types of string rewriting rules, called string pointer rules, defined on so-called legal strings. It has been shown that reduction graphs, graphs that are based on the…

The Sznajd model in less than a year has found several followers. An isolated person does not convince others; a group of people sharing the same opinions influences the neighbours much more easily. Thus on a square lattice, with variables…

This paper gives a new algorithm for sampling tree-weighted partitions of a large class of planar graphs. Formally, the tree-weighted distribution on $k$-partitions of a graph weights $k$-partitions proportional to the product of the number…

In recent years, in an effort to promote fairness in the election process, a wide variety of techniques and metrics have been proposed to determine whether a map is a partisan gerrymander. The most accessible measures, requiring easily…

This paper examines how homestead policies, which opened vast frontier lands for settlement, influenced the development of American frontier states. It uses a treatment propensity-weighted matrix completion model to estimate the…

The diffusion of information, norms, and practices across a social network can be initiated by compelling a small number of seed individuals to adopt first. Strategies proposed in previous work either assume full network information or…

"Compactness," or the use of shape as a proxy for fairness, has been a long-running theme in the scrutiny of electoral districts; badly-shaped districts are often flagged as examples of the abuse of power known as gerrymandering. The most…

When nodes can repeatedly update their behavior (as in agent-based models from computational social science or repeated-game play settings) the problem of optimal network seeding becomes very complex. For a popular spreading-phenomena model…