Bribery in path-disruption games

DOI10.1007/978-3-642-24873-3_19zbMATH Open1233.91050OpenAlexW128947650MaRDI QIDQ3095307FDOQ3095307

Authors Anja Rey, Jörg Rothe 

Publication date 28 October 2011

Published in Algorithmic Decision Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24873-3_19

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• Path-disruption games: bribery and a probabilistic model
• Probabilistic path-disruption games
• Probabilistic path-disruption games
• Cost of stability and least core in path-disruption games
• Coalitions in competitive bribery games

Cited in

(8)

• Answers set programs for non-transferable utility games: expressiveness, complexity and applications
• Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
• Probabilistic path-disruption games
• Values for cooperative games over graphs and games with inadmissible coalitions
• Probabilistic path-disruption games
• The complexity of priced control in elections
• Coalitions in competitive bribery games
• Path-disruption games: bribery and a probabilistic model

This page was built for publication: Bribery in path-disruption games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3095307)