Author:
Budish Eric B.,Cachon Gerard,Kessler Judd B.,Othman Abraham
Reference29 articles.
1. On the complexity of two-player win-lose games;D Abbott;Foundations of Computer Science, 2005. FOCS 2005. 46th Annual IEEE Symposium on,2005
2. School choice: A mechanism design approach;A Abdulkadiroglu;The American Economic Review,2003
3. The myth of the folk theorem;C Borgs;Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, STOC '08,2008
4. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes;E Budish;Journal of Political Economy,2011
5. The multi-unit assignment problem: theory and evidence from course allocation at harvard;E Budish;American Economic Review,2012
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pricing Equilibria and Graphical Valuations;ACM Transactions on Economics and Computation;2018-03-13
2. Approximation Algorithms for Maximin Fair Division;Proceedings of the 2017 ACM Conference on Economics and Computation;2017-06-20
3. The Complexity of Fairness Through Equilibrium;ACM Transactions on Economics and Computation;2016-08-26
4. Can Almost Everybody be Almost Happy?;Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science;2016-01-14