Hidden-action in multi-hop routing

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2005, Pages 117-126

  Feldman, Michal ^a   Chuang, John ^a   Stoica, Ion ^a   Shenker, Scott ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Contracts; Hidden action; Incentives; Mechanism design; Moral hazard; Multi hop; Principal agent model; Routing

Indexed keywords

HIDDEN-ACTION; INCENTIVES; MECHANISM DESIGN; MULTI-HOP;

CARRIER COMMUNICATION; CONTRACTS; SOCIAL ASPECTS; TELECOMMUNICATION NETWORKS; TELECOMMUNICATION SYSTEMS;

ROUTERS;

EID: 30044448416     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064009.1064022     Document Type: Conference Paper

References (32)

1. ANDERSEN, D. G., BALAKRISHNAN, H., KAASHOEK, M. F., AND MORRIS, R. Resilient Overlay Networks. In 18th ACM SOSP (2001).
2. ARCHER, A., AND TARDOS, E. Frugal path mechanisms.
3. ARGYRAKI, K., AND CHERITON, D. Loose Source Routing as a Mechanism for Traffic Policies. In Proceedings of SIGCOMM FDNA (August 2004).
4. ARGYRAKI, K., MANIATIS, P., CHERITON, D., AND SHENKER, S. Providing Packet Obituaries, In Third Workshop on Hot Topics in Networks (HotNets) (November 2004).
5. BANSAL, S., AND BAKER, M. Observation-based cooperation enforcement in ad hoc networks. Technical report, Stanford university (2003).
6. BLAKE, S., BLACK, D., CARLSON, M., DAVIES, E., WANG, Z., AND WEISS, W, An Architecture for Differentiated Service, RFC 2475, 1998.
7. BUCHEGGER, S., AND BOUDEC, J.-Y. L. Performance Analysis of the CONFIDANT Protocol: Cooperation of Nodes - Fairness in Dynamic Ad Hoc Networks. In IEEE/ACM Symposium on Mobile Ad Hoc Networking and Computing (MobiHOC)(2002).
8. BUCHEGGER, S., AND BOUDEC, J.-Y. L. Coping with False Accusations in Misbehavior Reputation Systems For Mobile Ad Hoc Networks, In EPFL, Technical report (2003).
9. BUCHEGGER, S., AND BOUDEC, J.-Y. L. The effect of rumor spreading in reputation systems for mobile ad-hoc networks. In WiOpt'03: Modeling and Optimization in Mobile Ad Hoc and Wireless Networks (2003).
10. BUTTYAN, L., AND HUBAUX, J. Stimulating Cooperation in Self-Organizing Mobile Ad-Hoc Networks. ACM/Kluwer Journal on Mobile Networks and Applications (MONET) (2003).
11. CAILLAUD, B., AND HERMALIN, B. Hidden Action and Incentives, Teaching Notes, U.C. Berkeley.
12. ELKIND, E., SAHAI, A., AND STEIGLITZ, K. Frugality in path auctions, 2004.
13. FEIGENBAUM, J., PAPADIMITRIOU, C., SAMI, R., AND SHENKER, S. A BGP-based Mechanism for Lowest-Cost Routing. In Proceedings of the ACM Symposium on Principles of Distributed Computing (2002).
14. FEIGENBAUM, J., SAMI, R., AND SHENKER, S. Mechanism Design for Policy Routing. In Yale University, Technical Report (2003).
15. FEIGENBAUM, J., AND SHENKER, S. Distributed Algorithmic Mechanism Design: Recent Results and Future Directions. In Proceedings of the International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (2002).
16. FRIEDMAN, E., AND SHENKER, S, Learning and implementation on the internet, In Manuscript. New Brunswick: Rutgers University, Department of Economics (1997).
17. HOLMSTROM, B. Moral Hazard in Teams. Bell Journal of Economics 13 (1982), 324-340.
18. HU, Y., PERRIG, A., AND JOHNSON, D. Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks. In Eighth Annual International Conference on Mobile Computing and Networking (Mobicom)(2002), pp. 12-23.
19. Hu, Y., PERRIG, A., AND JOHNSON, D. SEAD: Secure Efficient Distance Vector Routing for Mobile Ad Hoc Networks. In4th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA) (2002).
20. JAKOBSSON, M., HUBAUX, J.-P., AND BUTTYAN, L. A Micro-Payment Scheme Encouraging Collaboration in Multi-Hop Cellular Networks. In Financial Cryptography (2003).
21. LAKSHMINARAYANAN, K., STOICA, I., AND SHENKER, S. Routing as a service. In UCB Technical Report No. UCB/CSD-04-1327 (January 2004).
22. MARTI, S., GIULI, T. J., LAI, K., AND BAKER, M. Mitigating Routing Misbehavior in Mobile Ad Hoc Networks. In Proceedings of MobiCom (2000), pp. 255-265.
23. MASS-COLELL, A., WHINSTON, M., AND GREEN, J. Microeconomic Theory, Oxford University Press, 1995.
24. NISAN, N., AND RONEN, A. Algorithmic Mechanism Design. In Proceedings of the 31st Symposium on Theory of Computing (1999).
25. SANZGIRI, K., DAHILL, B., LEVINE, B., SHIELDS, C., AND BELDING-ROYER, E, A Secure Routing Protocol for Ad Hoc Networks. In International Conference on Network Protocols (ICNP) (2002).
26. SHNEIDMAN, J., AND PARKES, D. C. Overcoming rational manipulation in mechanism implementation, 2004.
27. STRAUSZ, R. Moral Hazard in Sequential Teams.Departmental Working Paper, Free University of Berlin (1996).
28. TEIXEIRA, R., GRIFFIN, T., SHAIKH, A., AND VOELKER, G. Network sensitivity to hot-potato disruptions. In Proceedings of ACM SIGCOMM (September 2004).
29. TEIXEIRA, R., SHAIKH, A., GRIFFIN, T., AND REXFORD, J. Dynamics of hot-potato routing in IP networks. InProceedings of ACM SIGMETRICS (June 2004).
30. YANG, X. NIRA: A New Internet Routing Architecture. In Proceedings of SIGCOMM FDNA (August 2003).
31. ZHONG, S., CHEN, J., AND YANG, Y. R. Sprite: A Simple, Cheat-Proof, Credit-Based System for Mobile Ad-Hoc Networks. In 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (2003).
32. ZHU, D., GRITTER, M., AND CHERITON, D. Feedback-based Routing. In Proc Hotnets-I (2002).