Condorcet winner configurations of linear networks

DOI10.1080/02331930801950852MaRDI QIDQ3577841zbMATH OpenOpenAlexFDO

Authors Jana Hajduková

Publication date 26 July 2010

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930801950852

zbMATH Keywords

algorithmsmajority votingfacility location

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Voting theory (91B12) Discrete location and assignment (90B80)

Recommendations

• Networks with Condorcet solutions
• Network winner determination problem
• Distributed Winner-Take-All in Dynamic Networks
• Generalized Condorcet winners
• Sets of alternatives as Condorcet winners
• On the relationship of the Condorcet winner and positional voting rules
• A note on the query complexity of the Condorcet winner problem
• The network of weighted majority rules and weighted majority games
• Equilibria in Networks
• Fixed Points of Competitive Threshold-Linear Networks

Cites work

• Algorithms for Voting and Competitive Location on a Network
• Condorcet winners for public goods
• Locating public facilities by majority: stability, consistency and group formation
• Networks with Condorcet solutions
• Obnoxious Facility Location on Graphs
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Outcomes of voting and planning in single facility location problems
• Self-selection consistent functions
• The Optimum Location of Multi-centres on a Graph

This page was built for publication: Condorcet winner configurations of linear networks

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