Search arXivSearch

arXiv · 2503.04053

Efficient, Fast, and Fair Voting Through Dynamic Resource Allocation in a Secure Election Physical Intranet

Abstract

Resource allocations in an election system, often with hundreds of polling locations over a territory such as a county, with the aim that voters receive fair and efficient services, is a challenging problem, as election resources are limited and the number of expected voters can be highly volatile through the voting period. This paper develops two propositions to ensure efficiency, fairness, resilience, and security. The first is to leverage Physical Internet (PI) principles, notably setting up a "secure election physical intranet" (SEPI) based on open resource sharing and flow consolidation between election facilities in the territory. The second is to adopt a smart dynamic resource allocation methodology within the SEPI based on queueing networks and lexicographic optimization. A queueing model is developed to provide feasible combinations of resources and individual performances for each polling location by considering layout and utilization constraints. A two-stage lexicographic optimizer receives the queueing model's outputs and finds an optimal solution that is less expensive, fast, and fair. A scenario-based case study validates the proposed methodology based on data from the 2020 US Presidential Election in Fulton County, Georgia, USA.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tiankuo Zhang, Benoit Montreuil, Ali V Barenji, Praveen Muthukrishnan. 2025-03-06. Efficient, Fast, and Fair Voting Through Dynamic Resource Allocation in a Secure Election Physical Intranet. https://arxiv.org/abs/2503.04053

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Control of chaos with minimal information transfer

This paper studies set-invariance and stabilization of hyperbolic sets over rate-limited channels. Our main results reveal a phenomenon which cannot be seen from a linearized analysis: the smallest data rate above which a hyperbolic set $Q$ can be made invariant is bounded below by the difference between two measures of instability: the first one describing the total instability on $Q$, and the second one describing the intrinsic instability which does not lead to exit from $Q$. In rigorous terms, these two quantities are the sum of unstable Lyapunov exponents and the metric entropy of an associated bundle random dynamical system, respectively. The gap between the two is well-known in dynamical systems and is often related to escape rates. A vanishing gap corresponds to the existence of a strange attractor inside $Q$ supporting an SRB measure. In this case, no information transfer to the controller is necessary, because the attractor already guarantees invariance. We prove that our lower bound is tight in two extreme cases, the one just described and the one without intrinsic instability. Furthermore, we apply our techniques to the problem of local uniform stabilization to a hyperbolic set and discuss an example built on the Hénon horseshoe.

math.OC

Tsallis Entropy Regularization for Linear Quadratic Regulator and Kullback-Leibler Control

Shannon entropy regularization is widely adopted in optimal control due to its ability to promote exploration and enhance robustness, e.g., maximum entropy reinforcement learning known as Soft Actor-Critic. The aim of this paper is to show that formulations based on Tsallis entropy, which is a one-parameter extension of Shannon entropy, retain many of the structural and computational advantages of Shannon-entropy-based approaches while offering additional benefits. In particular, we derive a closed-form solution for the linear quadratic regulator and an efficient computational method for the Kullback-Leibler control problem. We also demonstrate its usefulness in balancing between exploration and sparsity of the obtained control law.

math.OC

Computing the nearest scattering passive system

In this paper, we consider linear time-invariant control systems which are bounded real, also known as scattering passive. Our main theoretical contribution is to show the equivalence between such systems and port-Hamiltonian (PH) systems whose factors satisfy certain linear matrix inequalities. Based on this result, we propose a formulation for the problem of finding the nearest bounded real system to a given system, and design an algorithm combining alternating optimization and Nesterov's fast gradient method. This formulation also allows us to check whether a given system is bounded real by solving a semidefinite program, and provide a PH parametrization for it. We illustrate our proposed algorithms on real-world and synthetic data sets.

math.OC