On the combinatorial structure of the approval-voting polytope

DOI10.1006/jmps.2001.1411zbMath1027.91024MaRDI QIDQ1867363

Jean-Paul Doignon, Michel Regenwetter

Publication date: 2 April 2003

Published in: Journal of Mathematical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jmps.2001.1411

zbMATH Keywords

automorphism; facet; adjacency; combinatorial; probabilistic choice model; approval-voting polytope

Mathematics Subject Classification ID

91B12: Voting theory

91B14: Social choice

Related Items

Determining the automorphism group of the linear ordering polytope, Random utility models and their applications: Recent developments, Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron, The facets and the symmetries of the approval-voting polytope

Uses Software

• Magma
• PORTA
• LOLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hamiltonicity and combinatorial polyhedra
• The choice probabilities of the latent-scale model satisfy the size-independent model when \(n\) is small.
• An approval-voting polytope for linear orders
• The Magma algebra system. I: The user language
• Weak order polytopes.
• Set packing relaxations of some integer programs
• Adjacency on combinatorial polyhedra
• The facets and the symmetries of the approval-voting polytope
• Random utility representation of binary choice probabilities: Critical graphs yielding critical necessary conditions
• A random utility model for approval voting
• A Polynomial Time Algorithm for Unidimensional Unfolding Representations
• Lectures on Polytopes
• Determining the automorphism group of the linear ordering polytope