Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Sequential voting by veto: Making the Mueller-Moulin algorithm more versatile

From MaRDI portal
Publication:1207320
Jump to:navigation, search

DOI10.1007/BF00133642zbMath0773.90014OpenAlexW2090491812MaRDI QIDQ1207320

Moshé Machover, Dan S. Felsenthal

Publication date: 1 April 1993

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

Full work available at URL: https://doi.org/10.1007/bf00133642


zbMATH Keywords

Pareto optimalitysophisticated votingsequential voting by veto


Mathematics Subject Classification ID

Voting theory (91B12) Computational methods for problems pertaining to operations research and mathematical programming (90-08)


Related Items (4)

A lemma in open sequential voting by veto ⋮ Properties of open procedure of sequential veto-voting ⋮ The effects of communication on the occurrence of the tyranny of the majority under voting by veto ⋮ A solution to the two-person implementation problem




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Sophisticated voting outcomes and agenda control
  • Prudence versus sophistication in voting strategy
  • A multistage game representation of sophisticated voting for binary procedures
  • Black and Farquharson on order-of-voting effects: An extension




This page was built for publication: Sequential voting by veto: Making the Mueller-Moulin algorithm more versatile

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1207320&oldid=13273653"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 06:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki