REVIEW 2 cited by
A combinatorial representation of Arrow's single-peaked domains
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A combinatorial representation of Arrow's single-peaked domains
read the original abstract
The most studied class of Condorcet domains (acyclic sets of linear orders) is the class of peak-pit domains of maximal width. It has a number of combinatorial representations by such familiar combinatorial objects like rhombus tilings and arrangements of pseudolines. Arrow's single-peaked domains are peak-pit but do not have maximal width. We suggest how to represent them by means of generalised arrangements of pseudolines.
Forward citations
Cited by 2 Pith papers
-
An axiomatic framework from splitting and merging in MAT-labeled graphs, vines, and single-peaked domains
An axiomatic characterization using splitting and merging in combinatorial species shows that MAT-labeled complete graphs, regular vines, and maximal Arrow single-peaked domains share the same recursive structure, wit...
-
An axiomatic framework from splitting and merging in MAT-labeled graphs, vines, and single-peaked domains
Splitting and merging operations with compatibility conditions axiomatize and unify MAT-labeled complete graphs, regular vines, and maximal Arrow single-peaked domains, with further links to extremal lattices and tria...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.