Nash Equilibria and Dominant Strategies in Routing

[1]  R. Sarpong,et al.  Bio-inspired synthesis of xishacorenes A, B, and C, and a new congener from fuscol† †Electronic supplementary information (ESI) available. See DOI: 10.1039/c9sc02572c , 2019, Chemical science.

[2]  Ron Lavi,et al.  Algorithmic Mechanism Design , 2008, Encyclopedia of Algorithms.

[3]  Xiang-Yang Li,et al.  Towards truthful mechanisms for binary demand games: a general framework , 2005, EC '05.

[4]  Nicole Immorlica,et al.  First-price path auctions , 2005, EC '05.

[5]  Xiang-Yang Li,et al.  Design multicast protocols for non-cooperative networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[6]  Xiang-Yang Li,et al.  Truthful multicast routing in selfish wireless networks , 2004, MobiCom '04.

[7]  Yu Wang,et al.  Truthful Multicast in Selfish Wireless Networks , 2004 .

[8]  Noam Nisan,et al.  Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract , 2002, AAAI 2002.

[9]  Éva Tardos,et al.  Frugal path mechanisms , 2002, SODA '02.

[10]  Joan Feigenbaum,et al.  Sharing the Cost of Multicast Transmissions , 2001, J. Comput. Syst. Sci..

[11]  H. Moulin,et al.  Strategyproof sharing of submodular costs:budget balance versus efficiency , 2001 .

[12]  Yoav Shoham,et al.  Truth revelation in approximately efficient combinatorial auctions , 2002, EC '99.

[13]  Noam Nisan,et al.  Algorithmic mechanism design (extended abstract) , 1999, STOC '99.

[14]  Deborah Estrin,et al.  Sharing the “cost” of multicast trees: an axiomatic analysis , 1995, SIGCOMM '95.