Algorithmic Game Theory: Introduction to the Inefficiency of Equilibria
暂无分享,去创建一个
[1] Russ Bubley,et al. Randomized algorithms , 1995, CSUR.
[2] Éva Tardos,et al. Near-optimal network design with selfish agents , 2003, STOC '03.
[3] Tim Roughgarden,et al. The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[4] Tim Roughgarden,et al. Selfish routing and the price of anarchy , 2005 .
[5] Éva Tardos,et al. The effect of collusion in congestion games , 2006, STOC '06.
[6] Yishay Mansour,et al. Strong price of anarchy , 2007, SODA '07.
[7] Tim Roughgarden,et al. Designing networks with good equilibria , 2008, SODA '08.