The power of one evil secret agent
From MaRDI portal
Publication:2196556
Recommendations
Cites work
- scientific article; zbMATH DE number 2038734 (Why is no real title available?)
- A class of games possessing pure-strategy Nash equilibria
- Algorithms, games, and the internet
- Congestion games with player-specific payoff functions
- Cost-sharing scheduling games on restricted unrelated machines
- Fairness with an Honest Minority and a Rational Majority
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- On the existence of pure Nash equilibria in weighted congestion games
- On the impact of singleton strategies in congestion games
- Optimal cost-sharing in general resource selection games
- Rational synthesis
- Rationality and Adversarial Behavior in Multi-party Computation
- Restoring Pure Equilibria to Weighted Congestion Games
- Scheduling
- Selfish load balancing
- Stackelberg strategies for atomic congestion games
- The Price of Stability for Network Design with Fair Cost Allocation
- The complexity of pure Nash equilibria
- The efficiency of best-response dynamics
- Tight bounds for selfish and greedy load balancing
- Worst-case equilibria
This page was built for publication: The power of one evil secret agent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2196556)