Maximizing the minimum voter satisfaction on spanning trees

DOI10.1016/J.MATHSOCSCI.2009.05.002MaRDI QIDQ732928zbMATH OpenOpenAlexWikidataFDO

Authors Andreas Darmann, Christian Klamler, Ulrich Pferschy

Publication date 15 October 2009

Published in Mathematical Social Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.mathsocsci.2009.05.002

zbMATH Keywords

fairnesssocial choiceminimal spanning tree

Mathematics Subject Classification ID

Social choice (91B14) Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• A note on maximizing the minimum voter satisfaction on spanning trees
• Popular spanning trees
• It is difficult to tell if there is a Condorcet spanning tree
• Finding socially best spanning treesî
• Multiple voting location and single voting location on trees

Cites work

• scientific article; zbMATH DE number 3854738 (Why is no real title available?)
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• scientific article; zbMATH DE number 1897331 (Why is no real title available?)
• Approximating Min-Max (Regret) Versions of Some Polynomial Problems
• Axiomatization of the Shapley value on minimum cost spanning tree games
• Basic Geometry of Voting
• Characterizations of the plurality function
• Cost monotonicity, consistency and minimum cost spanning tree games
• On cost allocation for a spanning tree: A game theoretic approach
• Robust discrete optimization and its applications
• Scoring rules on dichotomous preferences
• Sharing a minimal cost spanning tree: beyond the folk solution
• The complexity of satisfiability problems

Cited in

(9)

• Finding socially best spanning treesî
• Collective decision making
• A note on maximizing the minimum voter satisfaction on spanning trees
• scientific article; zbMATH DE number 1163867 (Why is no real title available?)
• It is difficult to tell if there is a Condorcet spanning tree
• How hard is it to tell which is a Condorcet committee?
• Popular spanning trees
• Committee selection under weight constraints
• Collective combinatorial optimisation as judgment aggregation

This page was built for publication: Maximizing the minimum voter satisfaction on spanning trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732928)