Author:
Schapira Michael,Singer Yaron
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Alon, N., Matias, Y., Szegedy, M.: Jounal of computer and system sciences. The space complexity of approximating the frequency moment 58(1), 137–137 (1999)
2. Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks. In: SOSP 2001: Proceedings of the eighteenth ACM symposium on Operating systems principles, pp. 131–145. ACM, New York (2001)
3. Chun, B.-G., Fonseca, R., Stoica, I., Kubiatowicz, J.: Characterizing selfishly constructed overlay routing networks. In: INFOCOM (2004)
4. Clarke, E.H.: Multipart pricing of public goods. Public Choice 11, 17–33 (1971)
5. Dobzinski, S., Nisan, N., Schapira, M.: Approximation algorithms for combinatorial auctions with complement-free bidders. In: STOC (2005)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Item bidding for combinatorial public projects;Theoretical Computer Science;2017-05
2. Efficient Money Burning in General Domains;Theory of Computing Systems;2016-11
3. Mechanism Design with Selective Verification;Proceedings of the 2016 ACM Conference on Economics and Computation;2016-07-21
4. Item Pricing for Combinatorial Public Projects;Algorithmic Aspects in Information and Management;2016
5. Efficient Money Burning in General Domains;Algorithmic Game Theory;2015