Congestion games with malicious players

DOI10.1016/J.GEB.2009.04.017MaRDI QIDQ834852zbMATH OpenOpenAlexFDO

Authors Moshe Babaioff, Robert D. Kleinberg, Christos Papadimitriou

Publication date 27 August 2009

Published in Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.geb.2009.04.017

zbMATH Keywords

congestion gamesequilibriummalicious behaviorselfish routing

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Noncooperative games (91A10)

Recommendations

• Malicious Bayesian Congestion Games
• Algorithms and Computation
• Congestion games with mixed objectives
• Equilibria for networks with malicious users
• Congestion Games with Mixed Objectives

Cites work

• A class of games possessing pure-strategy Nash equilibria
• A course in game theory.
• A Further Generalization of the Kakutani Fixed Point Theorem, with Application to Nash Equilibrium Points
• Algorithms and Computation
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• Fault Tolerant Implementation
• How bad is selfish routing?
• scientific article; zbMATH DE number 3274494 (Why is no real title available?)
• On a theorem of Schmeidler
• On the complexity of the parity argument and other inefficient proofs of existence
• When selfish meets evil, Byzantine players in a virus inoculation game

Cited in

(18)

• Fault tolerance in large games
• Nash-stable coalition partition and potential functions in games with coalition structure
• Adversarial behavior in network games
• Saddle functions and robust sets of equilibria
• Computational aspects of uncertainty profiles and angel-daemon games
• Information diffusion in social sensing
• Malicious Bayesian Congestion Games
• Uniform mixed equilibria in network congestion games with link failures
• scientific article; zbMATH DE number 7378361 (Why is no real title available?)
• When selfish meets evil, Byzantine players in a virus inoculation game
• Algorithms and Computation
• ``Beat-your-rival routing games
• On poisoned Wardrop equilibrium in congestion games
• Graphical congestion games
• Algorithms and complexity for computing Nash equilibria in adversarial team games
• Multi-leader congestion games with an adversary
• Stackelberg thresholds in network routing games or the value of altruism
• Equilibria for networks with malicious users

This page was built for publication: Congestion games with malicious players

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