Nash equilibria in two-resource congestion games with player-specific payoff functions

DOI10.3390/G15020007zbMATH Open1544.91035MaRDI QIDQ6555679

Hatem Smaoui, Samir Sbabou, Fatima Khanchouche, Abderrahmane Ziad

Publication date: 14 June 2024

Published in: Games (Search for Journal in Brave)

zbMATH Keywords

game theoryNash equilibriacongestion gamesprice of anarchy

Mathematics Subject Classification ID

Potential and congestion games (91A14)

Cites Work

• Title not available (Why is that?)
• An ordinal game theory approach to the analysis and selection of partners in public-private partnership projects
• Strong equilibrium in network congestion games: increasing versus decreasing costs
• The structure and complexity of Nash equilibria for a selfish routing game
• Selfish load balancing and atomic congestion games
• Pure Nash equilibria in player-specific and weighted congestion games
• Equilibria in a model with partial rivalry
• Potential games
• Congestion games with player-specific payoff functions
• Computation of noncooperative equilibria in ordinal games
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• The Price of Stability for Network Design with Fair Cost Allocation
• On the impact of combinatorial structure on congestion games
• Algorithms for pure Nash equilibria in weighted congestion games
• The complexity of pure Nash equilibria
• ORDINAL GAMES
• Ordinal games and generalized Nash and Stackelberg solutions

This page was built for publication: Nash equilibria in two-resource congestion games with player-specific payoff functions

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