16 results on '"GAIRING, MARTIN"'
Search Results
2. Computing Approximate Pure Nash Equilibria in Shapley Value Weighted Congestion Games
3. Tight Bounds for Cost-Sharing in Weighted Congestion Games
4. Approximate Pure Nash Equilibria in Social Context Congestion Games
5. Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria
6. Congestion Games with Player-Specific Costs Revisited
7. Price of Stability in Polynomial Congestion Games
8. Computing Stable Outcomes in Hedonic Games
9. Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
10. Malicious Bayesian Congestion Games
11. Exact Price of Anarchy for Polynomial Congestion Games
12. Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
13. A Faster Combinatorial Approximation Algorithm for Scheduling Unrelated Parallel Machines
14. Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture
15. Nash Equilibria in Discrete Routing Games with Convex Latency Functions
16. Nashification and the Coordination Ratio for a Selfish Routing Game
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.