Project games
From MaRDI portal
Publication:5925706
DOI10.1016/j.tcs.2022.10.043OpenAlexW4308515708MaRDI QIDQ5925706
Jérôme Monnot, Laurent Gourvès, Vittorio Bilò
Publication date: 20 April 2023
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.043
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of game isomorphism
- A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
- Pure Nash equilibria in player-specific and weighted congestion games
- The canonical extensive form of a game form. II: Representation
- Potential games
- Congestion games with player-specific payoff functions
- A class of games possessing pure-strategy Nash equilibria
- Selfish unsplittable flows
- Incentives and Efficiency in Uncertain Collaborative Environments
- On the impact of combinatorial structure on congestion games
- The complexity of pure Nash equilibria
- Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
- Hedonic Coalitions: Optimality and Stability
- Dynamics of Profit-Sharing Games
- Hedonic Games
- Distributed Welfare Games
- Mechanisms for (mis)allocating scientific credit
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
- Computing Nash equilibria for scheduling on restricted parallel links
- Project games
- Project games
- Atomic resource sharing in noncooperative networks
This page was built for publication: Project games
