Perspectives of Monge properties in optimization
Discrete Applied Mathematics
Journal of the ACM (JACM)
How unfair is optimal routing?
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Fairness in routing and load balancing
Journal of Computer and System Sciences - Special issue on Internet algorithms
Load balancing in the L/sub p/ norm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Fairness measures for resource allocation
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Computing equilibria for congestion games with (im)perfect information
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Uncoordinated load balancing and congestion games in p2p systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Welfare maximization in congestion games
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Routing games with an unknown set of active players
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
A few good agents: multi-agent social learning
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 1
On the impact of combinatorial structure on congestion games
Journal of the ACM (JACM)
On the complexity of pure Nash equilibria in player-specific network congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
SIAM Journal on Discrete Mathematics
Finding social optima in congestion games with positive externalities
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Atomic congestion games on graphs and their applications in networking
IEEE/ACM Transactions on Networking (TON)
Optimal Cost Sharing for Resource Selection Games
Mathematics of Operations Research
| Hi-index | 0.00 |
We study two problems, that of computing social optimum and that of finding fair allocations, in the congestion game model of Milchtaich[8] Although we show that the general problem is hard to approximate to any factor, we give simple algorithms for natural simplifications. We also consider these problems in the symmetric network congestion game model [11, 4], and show hardness results and approximate solutions.