On singleton congestion games with resilience against collusion

DOI10.1007/978-3-030-89543-3_4MaRDI QIDQ2695271zbMATH OpenOpenAlexFDO

Authors Bugra Caskurlu, Fatih Erdem Kizilkaya, Özgün Ekici

Publication date 30 March 2023

Full work available at URL https://arxiv.org/abs/2011.01791

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Recommendations

• On the impact of singleton strategies in congestion games
• The effect of collusion in congestion games
• Games with congestion-averse utilities
• On congestion games with player-specific costs and resource failures
• A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games
• Optimal Mechanisms for Robust Coordination in Congestion Games
• Congestion games revisited
• Mathematical Foundations of Computer Science 2004

Cites work

• A class of games possessing pure-strategy Nash equilibria
• Coalition structure generation: a survey
• On existence of equilibrium under social coalition structures
• Partition equilibrium always exists in resource selection games
• Project games
• Reciprocal \(n\)-body collision avoidance
• Strong equilibrium in congestion games

Cited in

(1)

• On existence of equilibrium under social coalition structures

This page was built for publication: On singleton congestion games with resilience against collusion

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