arXiv (All)
open access
Query-efficient winner prediction in district-based elections
In a district-based election, N voters are partitioned into k districts, and each voter votes for one of m candidates. Each district elects a winner using the plurality rule (i.e. the candidate getting the largest number of votes is declared the winner, breaking ties as per some fixed rule), and the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Selection of electors - Drawing by lot#181349
- Propuestas para agilizar la publicación de resultados electorales como mecanismo para afianzar el sistema electoral y legitimación de representantes elegidos#233321
- BLUE DB: A Local-Level Election Database for 31 European Countries (2001–2025)#385687
- Resource Allocation for Massive Multiple Input Multiple Output Based Communications Systems#1027034
- The Political Theory of Data: Institutions, Algorithms, & Formats in Racial Redlining#92209
Record · ID 1155512
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive