Controlling the order of moves in voting by veto. I: Conditions for making the given decision
From MaRDI portal
Publication:394067
DOI10.1134/S1064230713010097zbMATH Open1279.91062MaRDI QIDQ394067FDOQ394067
Authors: A. I. Mashechkin, N. M. Novikova
Publication date: 24 January 2014
Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)
Recommendations
- Controlling the order of moves in voting by veto. II. Algorithms for constructing an optimal order of moves
- Sophisticated voting under the sequential Voting by Veto
- Properties of voting with veto power
- Properties of open procedure of sequential veto-voting
- scientific article; zbMATH DE number 6747925
- Sequential voting by veto: Making the Mueller-Moulin algorithm more versatile
- Voting by committees under constraints
- Voting by veto and the role of the compromise function
- Majority voting on orders
- Complexity of control by partitioning veto elections and of control by adding candidates to plurality elections
Cites Work
Cited In (4)
- Properties of open procedure of sequential veto-voting
- Controlling the order of moves in voting by veto. II. Algorithms for constructing an optimal order of moves
- A lemma in open sequential voting by veto
- Estimating the winning chances of a solution suggested by the first player under conditions of voting by veto
This page was built for publication: Controlling the order of moves in voting by veto. I: Conditions for making the given decision
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q394067)