DeepAI AI Chat
Log In Sign Up

Utility Ghost: Gamified redistricting with partisan symmetry

by   Dustin G. Mixon, et al.
The Ohio State University

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 votes, then under optimal play in our protocol, both parties win the same number of seats. We also evaluate our protocol in more realistic settings that show how our game nearly eliminates the first-player advantage exhibited in other redistricting protocols.


page 4

page 5


MOPaC: The Multiple Offers Protocol for Multilateral Negotiations with Partial Consensus

Existing protocols for multilateral negotiation require a full consensus...

DE-RSTC: A rational secure two-party computation protocol based on direction entropy

Rational secure multi-party computation (RSMC) means two or more rationa...

Game-Theoretically Secure Protocols for the Ordinal Random Assignment Problem

We study game-theoretically secure protocols for the classical ordinal a...

A symmetric protocol to establish service level agreements

We present a symmetrical protocol to repeatedly negotiate a desired serv...

An improvement of the upper bound for GKS communication game

The GKS game was formulated by Justin Gilmer, Michal Koucky, and Michael...

Strategic Contention Resolution in Multiple Channels

We consider the problem of resolving contention in communication network...