arXiv (All)
open access
A Topological Condition for Aggregation on Weak Preference Domains
This paper provides a topological construction for studying social aggregation of weak preferences over a finite set of alternatives. We identify weak preferences with the cells of the type $A_{n-1}$ braid arrangement and, equivalently, with the simplices of the corresponding type $A_{n-1}$ Coxeter
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
- Caged subsequences in permutations#793843
- Caged subsequences in permutations#789836
- Parking functions, Smirnov words, and noncrossing Chow polynomials#972080
- Balanced Gray Codes for Permutations and Rainbow Cycles for Associahedra#1014533
- Topological phase and its effective tuning in a ladder lattice#1123145
Record · ID 1130708
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