Manipulation in communication structures of graph-restricted weighted voting games

DOI10.1007/978-3-030-87756-9_13OpenAlexW3210674513MaRDI QIDQ2695440

Jörg Rothe, Joanna Kaczmarek

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-87756-9_13

Mathematics Subject Classification ID

Decision theory (91B06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Social choice (91B14) Matching models (91B68)

Cites Work

• Unnamed Item
• Unnamed Item
• Manipulating the quota in weighted voting games
• Exact complexity of exact-four-colorability
• The complexity of facets (and some facets of complexity)
• More complicated questions about maxima and minima, and some closures of NP
• Monotonicity of power in weighted voting games with restricted communication
• Structural control in weighted voting games
• Complexity of the exact domatic number problem and of the exact conveyor flow shop problem
• False-Name Manipulations in Weighted Voting Games
• Graphs and Cooperation in Games
• Mathematical Properties of the Banzhaf Power Index
• Weighted Voting Games
• False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time

This page was built for publication: Manipulation in communication structures of graph-restricted weighted voting games