Recognizing majority-rule equilibrium in spatial voting games

From MaRDI portal

Revision as of 23:48, 29 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1178172

Jump to:navigation, search

DOI10.1007/BF00177657zbMath0744.90016MaRDI QIDQ1178172

Craig A. Tovey, John J. III Bartholdi, Lakshmi S. Narasimhan

Publication date: 26 June 1992

Published in: Social Choice and Welfare (Search for Journal in Brave)

zbMATH Keywords

majority rule NP-complete spatial voting games

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Cooperative games (91A12) Voting theory (91B12) Social choice (91B14) Spatial models in sociology (91D25)

Related Items (7)

Bounds for the Nakamura number ⋮ On complexity of lobbying in multiple referenda ⋮ A polynomial-time algorithm for computing the yolk in fixed dimension ⋮ How hard is it to control an election? ⋮ The instability of instability of centered distributions ⋮ The almost surely shrinking yolk ⋮ Computational complexity in the design of voting rules

This page was built for publication: Recognizing majority-rule equilibrium in spatial voting games

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1178172&oldid=12026302"