Pith. sign in

REVIEW 1 cited by

2-Dimensional Euclidean Preferences

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

arxiv 2205.14687 v1 pith:PNIXJVBD submitted 2022-05-29 cs.GT cs.MA

classification cs.GTcs.MA
keywords alternativesdimensionaleuclideanvoterspreferenceprofilethreevoter
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

A preference profile with m alternatives and n voters is 2-dimensional Euclidean if both the alternatives and the voters can be placed into a 2-dimensional space such that for each pair of alternatives, every voter prefers the one which has a shorter Euclidean distance to the voter. We study how 2-dimensional Euclidean preference profiles depend on the values m and n. We find that any profile with at most two voters or at most three alternatives is 2-dimensional Euclidean while for three voters, we can show this property for up to seven alternatives. The results are tight in terms of Bogomolnaia and Laslier [2, Proposition 15(1)].

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Practical approach to $2$-Euclidean Preferences

    cs.GT 2025-02 conditional novelty 7.0 of 10

    A suite of convex-hull forbidden substructures, reduction rules, ILP, and QCP recognizes 2-Euclidean elections quickly, solving 283 more PrefLib instances than the previous algorithm.

Pith tools