Forming Plurality at Minimum Cost

DOI10.1007/978-3-319-15612-5_8MaRDI QIDQ5176574zbMATH OpenOpenAlexFDO

Authors Wei-Yin Lin, Yen-Wei Wu, Hung-Lung Wang, Kun-Mao Chao

Publication date 27 February 2015

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-15612-5_8

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Voting theory (91B12)

Recommendations

• Optimal coalition size when making proposals is costly
• On the cost-minimizing number of firms
• A generic approach to coalition formation
• Strategy-proof coalition formation
• Pareto optimality in coalition formation
• Pareto optimality in coalition formation
• Coalition formation under limited communication
• A Minimum-Cost Strategy for Cluster Recruitment
• scientific article; zbMATH DE number 1600673

Cited in

(5)

• Faster algorithms for computing plurality points
• Faster algorithms for computing plurality points
• On β-Plurality Points in Spatial Voting Games
• On β-Plurality Points in Spatial Voting Games.
• Plurality in spatial voting games with constant

This page was built for publication: Forming Plurality at Minimum Cost

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