Constituency Optimisation Through Hamiltonian Representation Of Mandates (COTHROM): Algorithmic Redistricting of Irish Election Boundaries

• URL: http://arxiv.org/abs/2606.20637v1
• Date: Tue, 02 Jun 2026 09:43:40 GMT
• Title: Constituency Optimisation Through Hamiltonian Representation Of Mandates (COTHROM): Algorithmic Redistricting of Irish Election Boundaries
• Abstract summary: We present the first computational framework for Irish electoral redistricting.<n>It optimises across multiple constitutional requirements while making trade-offs explicit and quantifiable.<n>We show that COTHROM consistently improves on the existing legal constituency boundaries for a range of objective weightings.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Electoral redistricting in Ireland's Proportional Representation Single Transferable Vote (PR-STV) system faces the challenge of selecting an optimally representative set of electoral boundaries from an enormous set of possible configurations, and where ``representative'' is a delicate balance of constitutional objectives that are often in tension with one another. We present the first computational framework for Irish electoral redistricting that systematically optimises across multiple constitutional requirements while making trade-offs explicit and quantifiable. The electoral redistricting problem is parsed using statistical physics, where constitutional objectives are considered as terms in a Potts Hamiltonian. Markov Chain Monte Carlo (MCMC) methods and simulated annealing are employed to minimise this objective function, systematically exploring this configuration space, with coupling constants as proxies for objective weightings. Multi Criterion Decision Analysis (MCDA) and Pareto Optimality is then utilised to remedy the ambiguity in choosing a certain objective weighting combination over others. With respect to proportional representation and compactness objectives evaluated in County Cork, COTHROM consistently improves on the existing legal constituency boundaries for a range of objective weightings.

Related papers

• Selective Ensemble Based on Preference-Directed Multi-Objective Bandits [90.75513823660775]
  We formalize a sequential decision problem under partially specified linear preferences.<n>We then propose a preference-directed upper confidence bound (PrefUCB) algorithm.<n> Experiments on large pre-trained model selective ensemble tasks and online asset allocation under institutional mandates validate our method.
  arXiv  Detail & Related papers  (2026-06-20T07:52:46Z)
• Constitutional Governance in Metric Spaces [8.575010739465993]
  Computational social choice and decision theory offer rich aggregation theory but no comprehensive process for egalitarian self-governance.<n>Here, we propose constitutional governance in metric spaces, integrating deliberation, amendment, and consensus.<n>We focus on the utility of the generalised median, prove that at majority threshold no misreport and study the compromise gap between best peak and unconstrained optimum.
  arXiv  Detail & Related papers  (2026-05-13T11:23:34Z)
• Bounded Rationality for LLMs: Satisficing Alignment at Inference-Time [52.230936493691985]
  We propose SITAlign, an inference framework that addresses the multifaceted nature of alignment by maximizing a primary objective while satisfying threshold-based constraints on secondary criteria.<n>We provide theoretical insights by deriving sub-optimality bounds of our satisficing based inference alignment approach.
  arXiv  Detail & Related papers  (2025-05-29T17:56:05Z)
• Multiscale Parallel Tempering for Fast Sampling on Redistricting Plans [1.1233768932957773]
  A persuasive method is to compare the plan with an ensemble of neutrally drawn redistricting plans. To audit the partisan difference between the ensemble and a given plan, one must ensure that the non-partisan criteria are matched. In this work, we generate a multiscale parallel tempering approach that makes local moves at each scale.
  arXiv  Detail & Related papers  (2024-01-30T21:33:05Z)
• Trust-Region-Free Policy Optimization for Stochastic Policies [60.52463923712565]
  We show that the trust region constraint over policies can be safely substituted by a trust-region-free constraint without compromising the underlying monotonic improvement guarantee. We call the resulting algorithm Trust-REgion-Free Policy Optimization (TREFree) explicit as it is free of any trust region constraints.
  arXiv  Detail & Related papers  (2023-02-15T23:10:06Z)
• Rethinking Counting and Localization in Crowds:A Purely Point-Based Framework [59.578339075658995]
  We propose a purely point-based framework for joint crowd counting and individual localization. We design an intuitive solution under this framework, which is called Point to Point Network (P2PNet)
  arXiv  Detail & Related papers  (2021-07-27T11:41:50Z)
• Fairmandering: A column generation heuristic for fairness-optimized political districting [0.0]
  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 and demographic input, and instead simply optimize for compactness. We claim that this is a flawed approach because compactness and fairness are qualities, and introduce a scalable two-stage method to explicitly optimize for arbitrary piecewise-linear definitions of fairness.
  arXiv  Detail & Related papers  (2021-03-21T19:22:42Z)
• Higher Performance Visual Tracking with Dual-Modal Localization [106.91097443275035]
  Visual Object Tracking (VOT) has synchronous needs for both robustness and accuracy. We propose a dual-modal framework for target localization, consisting of robust localization suppressingors via ONR and the accurate localization attending to the target center precisely via OFC.
  arXiv  Detail & Related papers  (2021-03-18T08:47:56Z)
• Dealing with Non-Stationarity in Multi-Agent Reinforcement Learning via Trust Region Decomposition [52.06086375833474]
  Non-stationarity is one thorny issue in multi-agent reinforcement learning. We introduce a $delta$-stationarity measurement to explicitly model the stationarity of a policy sequence. We propose a trust region decomposition network based on message passing to estimate the joint policy divergence.
  arXiv  Detail & Related papers  (2021-02-21T14:46:50Z)
• Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans [0.0]
  We present a new Sequential Monte Carlo (SMC) algorithm that generates a sample of redistricting plans converging to a realistic target distribution. We validate the accuracy of the proposed algorithm by using a small map where all redistricting plans can be enumerated. We then apply the SMC algorithm to evaluate the partisan implications of several maps submitted by relevant parties in a recent high-profile redistricting case in the state of Pennsylvania.
  arXiv  Detail & Related papers  (2020-08-13T23:26:34Z)
• The Essential Role of Empirical Validation in Legislative Redistricting Simulation [0.0]
  We apply a recently developed computational method that can efficiently enumerate all possible redistricting plans. We show that this algorithm scales to a state with a couple of hundred geographical units.
  arXiv  Detail & Related papers  (2020-06-17T20:51:43Z)
• A Computational Approach to Measuring Vote Elasticity and Competitiveness [24.88022242349515]
  competitiveness metrics evaluate a districting plan based on the extent to which district-level outcomes are in play or are likely to be closely contested. This paper examines several classes of competitiveness metrics motivated by recent reform proposals and then evaluate their potential outcomes across large ensembles of districting plans at the Congressional and state Senate levels. We highlight situation-specific difficulties in creating good competitiveness metrics and show that optimizing competitiveness can produce unintended consequences on other partisan metrics.
  arXiv  Detail & Related papers  (2020-05-26T14:01:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.