This paper proves that winner determination under Stable Voting and Simple Stable Voting is PSPACE-complete.

The paper proposes a non-cryptographic, End-to-End Verifiable (E2E-V) voting scheme that achieves Software-Free Verification (SFV) by allowing voters to audit election integrity using only basic arith…

This paper improves an algorithm for computing lower bounds on the margin of a Single Transferable Vote (STV) election, making risk-limiting audits more practical.

This paper proposes a secure liquid democracy mechanism using sealed delegation and ranked multi-delegation with personal fallback ballots, and evaluates its impact on representational accuracy and vo…

The paper introduces ACE, a novel voting protocol that achieves end-to-end verifiability and strong voter privacy by combining tally-hiding aggregation with an Audit-or-Cast challenge, eliminating the…

This paper characterizes stabilizability of stochastic dynamic matching on hypergraphs using the arrival rates and incidence matrix, and proposes a stabilizing policy.

This paper introduces online assignment policies for stochastic matching on hypergraphs, which are maximally stable and allow for the derivation of necessary and sufficient stability criteria.

This paper analyzes the Loki e-voting protocol, demonstrating that while it attempts to solve coercion-resistance without pre-agreed secrets, it remains vulnerable to specific attacks, suggesting that…

The paper proves that any voting rule based solely on wallet balance, including anti-plutocratic mechanisms like Quadratic Voting, is fundamentally vulnerable to Sybil attacks on permissionless blockc…

This paper presents an architecture for private and verifiable electronic voting using the Paillier cryptosystem, without a trusted key dealer, and proves its correctness under certain assumptions.

This paper presents a stable coreset of size O(ε^-2 log 1/ε) for the geometric median problem, which preserves the cost of every candidate solution and handles structural constraints.

The paper removes stability requirement from the progressive exploration algorithm for Dominating Set, yielding a fixed-parameter tractable algorithm on certain graph classes.

This paper introduces a new distributed computational model called the uniform port model, which allows for efficient self-stabilizing algorithms for local symmetry breaking problems on general graphs…

The paper proposes a secure, verifiable, and privacy-preserving e-collecting protocol tailored for the Swiss political system, guaranteeing participation privacy even without assuming an anonymous com…

This paper investigates the convergence and stability of equilibria in bimatrix two-player games using the optimistic exponential weights method, allowing step sizes to differ.

The paper proposes a method using on-chain voting analysis to detect emerging partisan communities within DAOs, demonstrating that addresses destined to fork cluster together months before actual orga…

The paper introduces COPF, an online framework that ensures deployment-stable counterfactual fairness in link recommendation systems operating on evolving graphs by monitoring and controlling group di…

The paper introduces two novel risk-limiting audit techniques—statistical manifest generation and direct ballot selection—that significantly reduce the computational complexity and time required for p…

The paper introduces a framework for measuring AI visibility using two complementary criteria: rank stability and structural sufficiency.