Author:
Azar Yossi,Birnbaum Benjamin,Karlin Anna R.,Mathieu Claire,Nguyen C. Thach
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Lecture Notes in Computer Science;N. Andelman,2004
2. Feige, U., Vondrak, J.: Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e. In: FOCS 2006, pp. 667–676 (2006)
3. Lahaie, S., Pennock, D., Saberi, A., Vohra, R.: Sponsored search auctions. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, pp. 699–716. Cambridge University Press, Cambridge (2007)
4. Lecture Notes in Computer Science;N. Buchbinder,2007
5. Goel, G., Mehta, A.: Online budgeted matching in random input models with applications to adwords. In: SODA 2008, pp. 982–991 (2008)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Satiation in Fisher Markets and Approximation of Nash Social Welfare;Mathematics of Operations Research;2023-07-18
2. Earning and Utility Limits in Fisher Markets;ACM Transactions on Economics and Computation;2019-08
3. On the configuration LP for maximum budgeted allocation;Mathematical Programming;2015-07-04
4. Valuated matroid-based algorithm for submodular welfare problem;Annals of Operations Research;2015-03-18
5. Sponsored Search Auctions;ACM Transactions on Intelligent Systems and Technology;2015-01-23