arXiv (All)
open access
The Facility Advantage in the One-Round Discrete Voronoi Game on a Line
In the one-round discrete Voronoi game a multiset $V$ of $n$ voters on a line is given; player P places $k$ facilities, player Q then places $\ell$, and each voter is won by the nearer facility, ties going to P. P wins if it keeps at least $n/2$ voters. In the vocabulary of competitive location this
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
- An Improved Upper Bound on the Threshold Bias of the Oriented-cycle Game#1013408
- Combinatorial games and the golden ratio on digraphs#617862
- Combinatorial games and the golden ratio on digraphs#617362
- Optimal Networks with Accumulative Costs and Bidirectional Communication#997552
- Robust Federated Q-Learning with Almost No Communication#1033944
Record · ID 1051332
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