1. On the impact of combinatorial structure on congestion games;H Ackermann;Journal of the ACM,2008
2. Settling the complexity of nash equilibrium in congestion games;Y Babichenko;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing,2021
3. Efficient coordination mechanisms for unrelated machine scheduling;I Caragiannis;Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms,2009
4. Efficient computation of approximate pure nash equilibria in congestion games;I Caragiannis;Proceedings of the 52nd Annual Symposium on Foundations of Computer Science,2011