Anarchy Is Free in Network Creation
暂无分享,去创建一个
[1] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.
[2] Tim Roughgarden,et al. Selfish routing and the price of anarchy , 2005 .
[3] Éva Tardos,et al. Near-optimal network design with selfish agents , 2003, STOC '03.
[4] É. Tardos,et al. Algorithmic Game Theory: Network Formation Games and the Potential Function Method , 2007 .
[5] Tim Roughgarden,et al. The Price of Stability for Network Design with Fair Cost Allocation , 2004, FOCS.
[6] Christos H. Papadimitriou,et al. Algorithms, games, and the internet , 2001, STOC '01.
[7] Noga Alon,et al. Basic network creation games , 2010, SPAA '10.
[8] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.
[9] Y. Mansour,et al. On Nash Equilibria for a Network Creation Game , 2006, TEAC.
[10] Matús Mihalák,et al. The Price of Anarchy in Network Creation Games Is (Mostly) Constant , 2013, Theory of Computing Systems.
[11] Tim Roughgarden,et al. The price of anarchy is independent of the network topology , 2002, STOC '02.
[12] Susanne Albers,et al. On the value of coordination in network design , 2008, SODA '08.
[13] David C. Parkes,et al. The price of selfish behavior in bilateral network formation , 2005, PODC '05.
[14] Gabrielle Demange,et al. A Survey of Network Formation Models: Stability and Efficiency , 2005 .
[15] Scott Shenker,et al. On a network creation game , 2003, PODC '03.