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

Easy weighted majority games

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

DOI10.1016/S0165-4896(99)00050-5zbMath0962.91006MaRDI QIDQ1590151

Anand Mohan Goel, Trilochan Sastry, Nilotpal Chakravarty

Publication date: 19 December 2000

Published in: Mathematical Social Sciences (Search for Journal in Brave)


zbMATH Keywords

voting gameweighted majorityeasy-unbalanced sequentialgeneralized unbalanced


Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Cooperative games (91A12)


Related Items (4)

On the use of binary decision diagrams for solving problems on simple games ⋮ The complexity of power indexes with graph restricted coalitions ⋮ Analyzing power in weighted voting games with super-increasing weights ⋮ Analyzing Power in Weighted Voting Games with Super-Increasing Weights



Cites Work

  • Solving sequential knapsack problems
  • NP-completeness of some problems concerning voting games
  • On the computational power of pushdown automata
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Easy weighted majority games

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