Publications

Found 22 results
Author Title Type [ Year(Desc)]
Filters: Author is Joan Feigenbaum  [Clear All Filters]
2000
Feigenbaum, J., Papadimitriou C. H., & Shenker S. J. (2000).  Sharing the Cost of Multicast Transmissions. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC 2000). 218-227.
2001
Feigenbaum, J., Krishnamurthy A., Sami R., & Shenker S. J. (2001).  Approximation and Collusion in Multicast Cost Sharing. Proceedings of the Third ACM Conference on Electronic Commerce (ACM-EE 2001). 253-255.
Feigenbaum, J., Papadimitriou C. H., & Shenker S. J. (2001).  Sharing the Cost of Multicast Transmissions. Journal of Computer and System Sciences. 63(1), 21-41.
2002
Feigenbaum, J., Nisan N., Ramachandran V., Sami R., & Shenker S. J. (2002).  Agents' Privacy In Distributed Algorithmic Mechanisms (Position Paper).
Feigenbaum, J., Papadimitriou C. H., Sami R., & Shenker S. J. (2002).  A BGP-Based Mechanism for Lowest-Cost Routing. Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC 2002). 173-182.
Feigenbaum, J., & Shenker S. J. (2002).  Distributed Algorithmic Mechanism Design: Recent Results and Future Directions. Proceedings of the 6th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM'02). 1-13.
Feigenbaum, J., Krishnamurthy A., Sami R., & Shenker S. J. (2002).  Hardness Results for Multicast Cost Sharing. Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2002). 133-144.
Feigenbaum, J., & Shenker S. J. (2002).  Incentives and Internet Computation. 33(4), 37-54.
2003
Feigenbaum, J., Krishnamurthy A., Sami R., & Shenker S. J. (2003).  Hardness Results for Multicast Cost Sharing. Theoretical Computer Science. 304(1-3), 215-236.
Feigenbaum, J., Sami R., & Shenker S. J. (2003).  Mechanism Design for Policy Routing.
2004
Feigenbaum, J., Archer A.., Krishnamurthy A., Sami R., & Shenker S. J. (2004).  Approximation and Collusion in Multicast Cost Sharing. Games and Economic Behavior. 47(1), 36-71.
Feigenbaum, J., Sami R., & Shenker S. J. (2004).  Mechanism Design for Policy Routing. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC 2004). 11-20.
Bergemann, D., Feigenbaum J., Shenker S. J., & Smith J. M. (2004).  Towards an Economic Analysis of Trusted Systems.
Bergemann, D., Feigenbaum J., Shenker S. J., & Smith J. M. (2004).  Towards an Economic Analysis of Trusted Systems (Position Paper). Proceedings of the Third Workshop on Economics and Information Security, Minneapolis, Minnesota.
2005
Feigenbaum, J., Papadimitriou C. H., Sami R., & Shenker S. J. (2005).  A BGP-Based Mechanism for Lowest-Cost Routing. Distributed Computing. 18(1), 61-72.
Bergemann, D., Eisenbach T.., Feigenbaum J., & Shenker S. J. (2005).  Flexibility as an Instrument in DRM Systems. Proceedings of 2005 Workshop on the Economics of Information Security (WEIS 2005).
2006
Feigenbaum, J., Ramachandran V., & Schapira M. (2006).  Incentive-Compatible Interdomain Routing. Proceedings of the 7th ACM Conference on Electronic Commerce (EC'06). 130-139.
Feigenbaum, J., Sami R., & Shenker S. J. (2006).  Mechanism Design for Policy Routing. Distributed Computing. 18, 11-20.
2007
Feigenbaum, J., Schapira M., & Shenker S. J. (2007).  Distributed Algorithmic Mechanism Design. 363-384.
2012
Feigenbaum, J., P. Godfrey B., Panda A., Schapira M., Shenker S. J., & Singla A. (2012).  Brief Announcement: On the Resilience of Routing Tables. 237-238.
Gupta, D., Segal A., Panda A., Segev G., Schapira M., Feigenbaum J., et al. (2012).  A New Approach to Interdomain Routing Based on Secure Multi-Party Computation. 37-42.
Feigenbaum, J., P. Godfrey B., Panda A., Schapira M., Shenker S. J., & Singla A. (2012).  On the Resilience of Routing Tables. 1-7.