Manipulation in communication structures of graph-restricted weighted voting games
From MaRDI portal
Recommendations
Cites work
- Complexity of the exact domatic number problem and of the exact conveyor flow shop problem
- Exact complexity of exact-four-colorability
- False-name manipulation in weighted voting games is hard for probabilistic polynomial time
- False-name manipulations in weighted voting games
- Graphs and Cooperation in Games
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1357433 (Why is no real title available?)
- Manipulating the quota in weighted voting games
- Mathematical Properties of the Banzhaf Power Index
- Monotonicity of power in weighted voting games with restricted communication
- More complicated questions about maxima and minima, and some closures of NP
- Structural control in weighted voting games
- The complexity of facets (and some facets of complexity)
- Weighted voting games
Cited in
(3)
This page was built for publication: Manipulation in communication structures of graph-restricted weighted voting games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695440)