Finding socially best spanning treesî

DOI10.1007/S11238-010-9228-1MaRDI QIDQ2430005zbMATH OpenOpenAlexWikidataFDO

Authors Andreas Darmann, Christian Klamler, Ulrich Pferschy

Publication date 5 April 2011

Published in Theory and Decision (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11238-010-9228-1

zbMATH Keywords

ranking spanning treessocial choicesocially best spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social choice (91B14)

Recommendations

• Popular spanning trees
• It is difficult to tell if there is a Condorcet spanning tree
• A note on maximizing the minimum voter satisfaction on spanning trees
• Optimality conditions in preference-based spanning tree problems
• A preference-based approach to spanning trees and shortest paths problems

Cites work

• A note on maximizing the minimum voter satisfaction on spanning trees
• A preference-based approach to spanning trees and shortest paths problems
• Arbres minimaux d'un graphe preordonne
• Basic Geometry of Voting
• Characterizations of the plurality function
• Choice under complete uncertainty: Axiomatic characterizations of some decision rules
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Comments on bases in dependence structures
• Cost monotonicity, consistency and minimum cost spanning tree games
• Graphs, networks and algorithms.
• scientific article; zbMATH DE number 3148878 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 1897331 (Why is no real title available?)
• Maximal-element rationalizability
• Maximizing the minimum voter satisfaction on spanning trees
• Measurement Theory
• Network flows. Theory, algorithms, and applications.
• Sharing a minimal cost spanning tree: beyond the folk solution
• Signed orders and power set extensions
• Voting schemes for which it can be difficult to tell who won the election

Cited in

(10)

• Popular branchings and their dual certificates
• The traveling group problem
• It is difficult to tell if there is a Condorcet spanning tree
• Committee selection under weight constraints
• Popular branchings and their dual certificates
• Popular spanning trees
• Popular arborescences and their matroid generalization
• A preference-based approach to spanning trees and shortest paths problems
• Maximizing the minimum voter satisfaction on spanning trees
• A note on maximizing the minimum voter satisfaction on spanning trees

This page was built for publication: Finding socially best spanning treesî

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