Hidden-action in multi-hop routing
暂无分享,去创建一个
Scott Shenker | Ion Stoica | Michal Feldman | John C.-I. Chuang | M. Feldman | I. Stoica | S. Shenker | J. Chuang
[1] Bengt Holmstrom,et al. Moral Hazard in Teams , 1982 .
[2] E. Rasmusen. Moral Hazard in Risk-Averse Teams , 1987 .
[3] Anindya Banerjee,et al. Simultanenous Versus Sequential Move Structures in Principal-Agent Models , 1992 .
[4] Bassam Halabi,et al. Internet Routing Architectures , 1997 .
[5] Eric J. Friedman,et al. Learning and Implementation on the Internet , 1997 .
[6] Roland Strausz. Moral Hazard in Sequential Teams , 1997 .
[7] David L. Black,et al. An Architecture for Differentiated Service , 1998 .
[8] Noam Nisan,et al. Algorithmic mechanism design (extended abstract) , 1999, STOC '99.
[9] Paul Syverson,et al. Onion Routing for Anonymous and Private Internet Connections , 1999 .
[10] Bernard Caillaud,et al. Hidden Action and Incentives , 2000 .
[11] Mary Baker,et al. Mitigating routing misbehavior in mobile ad hoc networks , 2000, MobiCom '00.
[12] Peter Druschel,et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .
[13] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.
[14] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.
[15] D. Andersen,et al. Resilient overlay networks , 2002, CCRV.
[16] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[17] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.
[18] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[19] Éva Tardos,et al. Frugal path mechanisms , 2002, SODA '02.
[20] Yih-Chun Hu,et al. Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks , 2002, MobiCom '02.
[21] Yih-Chun Hu,et al. SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks , 2002, Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications.
[22] Elizabeth M. Belding-Royer,et al. A secure routing protocol for ad hoc networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..
[23] Joan Feigenbaum,et al. Distributed algorithmic mechanism design: recent results and future directions , 2002, DIALM '02.
[24] Jean-Yves Le Boudec,et al. Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.
[25] Jean-Yves Le Boudec,et al. Performance analysis of the CONFIDANT protocol , 2002, MobiHoc '02.
[26] Mary Baker,et al. Observation-based Cooperation Enforcement in Ad Hoc Networks , 2003, ArXiv.
[27] S. Buchegger,et al. Coping with False Accusations in Misbehavior Reputation Systems for Mobile Ad-hoc Networks , 2003 .
[28] J. Shneidman,et al. Overcoming Rational Manipulation in Mechanism Implementations , 2003 .
[29] David R. Cheriton,et al. Feedback based routing , 2003, CCRV.
[30] Levente Buttyán,et al. Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks , 2003, Mob. Networks Appl..
[31] Jean-Yves Le Boudec,et al. The Effect of Rumor Spreading in Reputation Systems for Mobile Ad-hoc Networks , 2003 .
[32] Markus Jakobsson,et al. A Micro-Payment Scheme Encouraging Collaboration in Multi-hop Cellular Networks , 2003, Financial Cryptography.
[33] Alex C. Snoeren,et al. Priority Forwarding in Ad Hoc Networks with Self-Interested Parties , 2003 .
[34] Xiaowei Yang,et al. NIRA: a new Internet routing architecture , 2003, FDNA '03.
[35] Sheng Zhong,et al. Sprite: a simple, cheat-proof, credit-based system for mobile ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[36] David R. Cheriton,et al. Loose source routing as a mechanism for traffic policies , 2004, FDNA '04.
[37] Scott Shenker,et al. Providing Packet Obituaries , 2004 .
[38] Renata Teixeira,et al. Network sensitivity to hot-potato disruptions , 2004, SIGCOMM 2004.
[39] Nicolas Christin,et al. On the Cost of Participating in a Peer-to-Peer Network , 2004, IPTPS.
[40] Joan Feigenbaum,et al. Mechanism design for policy routing , 2004, PODC.
[41] Renata Teixeira,et al. Network sensitivity to hot-potato disruptions , 2004, SIGCOMM '04.
[42] Kenneth Steiglitz,et al. Frugality in path auctions , 2004, SODA '04.
[43] Joan Feigenbaum,et al. Mechanism design for policy routing , 2004, PODC '04.
[44] Renata Teixeira,et al. Dynamics of hot-potato routing in IP networks , 2004, SIGMETRICS '04/Performance '04.
[45] Joan Feigenbaum,et al. A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.
[46] Scott Shenker,et al. Routing as a Service , 2006 .