How to Put through Your Agenda in Collective Binary Decisions

DOI10.1007/978-3-642-41575-3_3MaRDI QIDQ2868543zbMATH OpenOpenAlexFDO

Authors Noga Alon, Robert Bredereck, Jiehua Chen, Stefan Kratsch, Rolf Niedermeier, Gerhard J. Woeginger

Publication date 17 December 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-41575-3_3

zbMATH Keywords

computational complexityvoterscollective binary decisionsfavorite ballot

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Voting theory (91B12)

Recommendations

• DECIDING WHEN TO DECIDE: COLLECTIVE DELIBERATION AND OBSTRUCTION
• Majority selection of one alternative from a binary agenda
• Deliberating Collective Decisions
• Collective choice procedures
• Binary public decisions and undominated mechanisms
• Agendas in legislative decision-making
• The complexity of collective decision
• A foundation for strategic agenda voting
• Collective decision making in hierarchies
• Choosing choices: agenda selection with uncertain issues

Cited in

(3)

• Counting votes in coupled decisions. An efficient method for counting votes in coupled decisions with multiple inequality restrictions
• Combinatorics and probability. Abstracts from the workshop held April 14--20, 2013.
• Collective schedules: axioms and algorithms

This page was built for publication: How to Put through Your Agenda in Collective Binary Decisions

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