Author:
Feigenbaum Joan,Sami Rahul,Shenker Scott
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference18 articles.
1. Archer, A., Tardos, É: Frugal path mechanisms. In: Proceedings of 13th ACM-SIAM Symposium on Discrete Algorithms (SODA ’02), pp. 991–999. ACM Press/SIAM, New York (2002).
2. Clarke, E: Multipart pricing of public goods. Public Choice 11, 17–33 (1971)
3. Edmonds, J.: Optimal Branchings. Journal of Research of the National Bureau of Standards B71, 233–240 (1967)
4. Elkind, E., Sahai, A., Steiglitz, K.: Frugality in path auctions. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA ’04), pp. 701–709. ACM Press/SIAM, New York (2004)
5. Feigenbaum, J., Papadimitriou, C., Sami, R., Shenker, S.: A BGP-based mechanism for lowest-cost routing. Distrib. Comput. 18(1), 61–72 (2005). A preliminary version appeared in the 2002 ACM Symposium on Principles of Distributed Computing (PODC’02)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Faithful Edge Federated Learning: Scalability and Privacy;IEEE Journal on Selected Areas in Communications;2021-12
2. Setting lower bounds on truthfulness;Games and Economic Behavior;2018-07
3. On the stability of interdomain routing;ACM Computing Surveys;2012-08
4. Incentive-compatible interdomain routing;Distributed Computing;2011-02-25
5. Interdomain Routing and Games;SIAM Journal on Computing;2011-01