相关论文: Auditing Hamiltonian Elections

We present a procedure for averaging one-parameter random unitary groups and random self-adjoint groups. Central to this is a generalization of the notion of weak convergence of a sequence of measures and the corresponding generalization of…

Elections seem simple---aren't they just counting? But they have a unique, challenging combination of security and privacy requirements. The stakes are high; the context is adversarial; the electorate needs to be convinced that the results…

We propose a statistical framework for quantifying the importance of single events that do not provide intermediate rewards but offer implicit incentives through the reward structure at the end of a multi-event contest. Applying the…

We study the complexity of candidate control in participatory budgeting elections. The goal of constructive candidate control is to ensure that a given candidate wins by either adding or deleting candidates from the election (in the…

The fast spreading adoption of machine learning (ML) by companies across industries poses significant regulatory challenges. One such challenge is scalability: how can regulatory bodies efficiently audit these ML models, ensuring that they…

Partisan gerrymandering poses a threat to democracy. Moreover, the complexity of the districting task may exceed human capacities. One potential solution is using computational models to automate the districting process by optimizing…

American options are studied in a general discrete market in the presence of proportional transaction costs, modelled as bid-ask spreads. Pricing algorithms and constructions of hedging strategies, stopping times and martingale…

The rapid deployment of AI systems in high-stakes domains, including those classified as high-risk under the The EU AI Act (Regulation (EU) 2024/1689), has intensified the need for reliable compliance auditing. For binary classifiers,…

Symmetries in a Hamiltonian play an important role in quantum physics because they correspond directly with conserved quantities of the related system. In this paper, we propose quantum algorithms capable of testing whether a Hamiltonian…

Single Transferable Vote (STV) elections are a principled approach to electing multiple candidates in a single election. Each ballot has a starting value of 1, and a candidate is elected if they gather a total vote value more than a defined…

Examination of precinct level data in US presidential elections reveals a correlation of large precincts and increased fraction of Republican votes. The large precinct bias is analyzed with respect to voter heterogeneity and voter…

In the context of computational social choice, we study voting methods that assign a set of winners to each profile of voter preferences. A voting method satisfies the property of positive involvement (PI) if for any election in which a…

It is important to study how strategic agents can affect the outcome of an election. There has been a long line of research in the computational study of elections on the complexity of manipulative actions such as manipulation and bribery.…

Instant-runoff voting (IRV) is used in several countries around the world. It requires voters to rank candidates in order of preference, and uses a counting algorithm that is more complex than systems such as first-past-the-post or scoring…

Constructive election control considers the problem of an adversary who seeks to sway the outcome of an electoral process in order to ensure that their favored candidate wins. We consider the computational problem of constructive election…

Classical voting rules assume that ballots are complete preference orders over candidates. However, when the number of candidates is large enough, it is too costly to ask the voters to rank all candidates. We suggest to fix a rank k, to ask…

In centralized mechanisms and platforms, participants do not fully observe each others' type reports. Hence, if there is a deviation from the promised mechanism, participants may be unable to detect it. We formalize a notion of auditabilty…

Shortlisting is the process of selecting a subset of alternatives from a larger pool for further consideration or final decision-making. It is widely applied in social choice and multi-agent system scenarios. The growing demand for…

A Ranked candidate voting method based on Phragmen's procedure is described that can be used to produce a top-down proportional candidate list. The method complies with the Droop proportionality criterion satisfied by Single Transferable…

Randomisation and time-sharing are some of the oldest methods to achieve fairness. I make a case that applying these approaches to social choice settings constitutes a powerful paradigm that deserves an extensive and thorough examination. I…