arXiv (All)
open access
Strategyproof Aggregation in Euclidean Spaces: Rigidity and Median Optimality
We study deterministic strategyproof aggregation in finite-dimensional Euclidean spaces. For every odd number $n\ge3$ of agents and every finite dimension, we prove that the coordinate-wise median minimizes the worst-case approximation ratio for total Euclidean distance among all continuous, anonymo
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
- Cops and Robber game in higher-dimensional manifolds with spherical and Euclidean metric#1038999
- Game-Theoretic Robustness in Cooperation and Prejudice Reduction: A Graphic Measure#737767
- Strategic Facility Location in Euclidean Spaces#972081
- BalLOT: Balanced $k$-means clustering with optimal transport#1155085
- Perspectives on the unit distance problem#997781
Record · ID 1013989
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