Fetching the paper…
Reading the bibliography…
Computing market equilibria is an important practical problem for market design, for example in fair division of items.
Hayek FA (1945) The use of knowledge in society. The American economic review 35(4):519–530
1945
Earlier work this paper cites.
Eisenberg E, Gale D (1959) Consensus of subjective probabilities: The pari-mutuel method. The Annals of Mathematical Statistics 30(1):165–168
1959
Earlier work this paper cites.
Kantorovich LV (1960) Mathematical methods of organizing and planning production. Management Science 6(4):366–422
1960
Earlier work this paper cites.
Negishi T (1960) Welfare economics and existence of an equilibrium for a competitive economy. Metroeconomica 12(2-3):92–97
1960
Earlier work this paper cites.
Scarf H (1967) On the computation of equilibrium prices. Cowles Foundation Discussion Papers 232, Cowles Foundation for Research in Economics, Yale University
1967
Earlier work this paper cites.
Varian HR, et al. (1974) Equity, envy, and efficiency. Journal of Economic Theory 9(1):63–91
1974
Earlier work this paper cites.
Kantorovich L (1975) Mathematics in economics: achievements, difficulties, perspectives. Technical report, Nobel Prize Committee
1975
Earlier work this paper cites.
Berry S, Levinsohn J, Pakes A (1995) Automobile prices in market equilibrium. Econometrica: Journal of the Econometric Society 841–890
1995
Earlier work this paper cites.
Goldberg K, Roeder T, Gupta D, Perkins C (2001) Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval 4(2):133–151
2001
Earlier work this paper cites.
Roth AE (2002) The economist as engineer: Game theory, experimentation, and computation as tools for design economics. Econometrica 70(4):1341–1378
2002
Earlier work this paper cites.
Porter D, Rassenti S, Roopnarine A, Smith V (2003) Combinatorial auction design. Proceedings of the National Academy of Sciences 100(19):11153–11157
2003
Earlier work this paper cites.
Hommes CH (2006) Heterogeneous agent models in economics and finance. Handbook of computational economics 2:1109–1186
2006
Earlier work this paper cites.
Borgs C, Chayes J, Immorlica N, Jain K, Etesami O, Mahdian M (2007) Dynamics of bid optimization in online advertisement auctions. Proceedings of the 16th international conference on World Wide Web , 531–540 (ACM)
2007
Earlier work this paper cites.
Chen L, Ye Y, Zhang J (2007) A note on equilibrium pricing as convex optimization. International Workshop on Web and Internet Economics , 7–16 (Springer)
2007
Earlier work this paper cites.
Gilpin A, Sandholm T, Sørensen TB (2007) Potential-aware automated abstraction of sequential games, and holistic equilibrium analysis of texas hold’em poker. Proceedings of the 22nd national conference on Artificial intelligence-Volume 1 , 50–57 (AAAI Press)
2007
Earlier work this paper cites.
Megiddo N, Vazirani VV (2007) Continuity properties of equilibrium prices and allocations in linear Fisher markets. International Workshop on Web and Internet Economics , 362–367 (Springer)
2007
Earlier work this paper cites.
Nisan N, Roughgarden T, Tardos E, Vazirani VV (2007) Algorithmic game theory (Cambridge University Press)
2007
Earlier work this paper cites.
Chen X, Dai D, Du Y, Teng SH (2009) Settling the complexity of Arrow-Debreu equilibria in markets with additively separable utilities. 2009 50th Annual IEEE Symposium on Foundations of Computer Science , 273–282 (IEEE)
2009
Earlier work this paper cites.
Chen X, Teng SH (2009) Spending is not easier than trading: on the computational equivalence of Fisher and Arrow-Debreu equilibria. International Symposium on Algorithms and Computation , 647–656 (Springer)
2009
Earlier work this paper cites.
Shmyrev VI (2009) An algorithm for finding equilibrium in the linear exchange model with fixed budgets. Journal of Applied and Industrial Mathematics 3(4):505
2009
Earlier work this paper cites.
Walsh WE, Boutilier C, Sandholm T, Shields R, Nemhauser G, Parkes DC (2010) Automated channel abstraction for advertising auctions. Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence , 887–894 (AAAI Press)
2010
Earlier work this paper cites.
Birnbaum B, Devanur NR, Xiao L (2011) Distributed algorithms via gradient descent for Fisher markets. Proceedings of the 12th ACM conference on Electronic commerce , 127–136 (ACM)
2011
Earlier work this paper cites.
Budish E (2011) The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes. Journal of Political Economy 119(6):1061–1103
2011
Earlier work this paper cites.
Chambolle A, Pock T (2011) A first-order primal-dual algorithm for convex problems with applications to imaging. Journal of mathematical imaging and vision 40(1):120–145
2011
Earlier work this paper cites.
Edmonds J, Pruhs K (2011) Cake cutting really is not a piece of cake. ACM Trans. Algorithms 7(4):51
2011
Earlier work this paper cites.
Recht B (2011) A simpler approach to matrix completion. Journal of Machine Learning Research 12:3413–3430
2011
Earlier work this paper cites.
Lanctot M, Gibson R, Burch N, Zinkevich M, Bowling M (2012) No-regret learning in extensive-form games with imperfect recall. Proceedings of the 29th International Coference on International Conference on Machine Learning , 1035–1042 (Omnipress)
2012
Earlier work this paper cites.
Bottou L, Peters J, Quiñonero-Candela J, Charles DX, Chickering DM, Portugaly E, Ray D, Simard P, Snelson E (2013) Counterfactual reasoning and learning systems: The example of computational advertising. The Journal of Machine Learning Research 14(1):3207–3260
2013
Earlier work this paper cites.
Chen Y, Lai JK, Parkes DC, Procaccia AD (2013) Truth, justice, and cake cutting. Games and Economic Behavior 77(1):284–297
2013
Cited alongside, same era.
Domahidi A, Chu E, Boyd S (2013) ECOS: An SOCP solver for embedded systems. European Control Conference (ECC) , 3071–3076
2013
Cited alongside, same era.
Aziz H, Ye C (2014) Cake cutting algorithms for piecewise constant and piecewise uniform valuations. International Conference on Web and Internet Economics , 1–14 (Springer)
2014
Cited alongside, same era.
Balkanski E, Kurokawa D, Brânzei S, Procaccia AD (2014) Simultaneous cake cutting. Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence , 566–572, AAAI’14 (AAAI Press)
2014
Cited alongside, same era.
Ganzfried S, Sandholm T (2014) Potential-aware imperfect-recall abstraction with earth mover’s distance in imperfect-information games. Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence , 682–690 (AAAI Press)
Paszke A, Gross S, Chintala S, Chanan G, Yang E, DeVito Z, Lin Z, Desmaison A, Antiga L, Lerer A (2017) Automatic differentiation in PyTorch
2017
Later among the works it cites.
Peysakhovich A, Ugander J (2017) Learning context-dependent preferences from raw data. Proceedings of the 12th workshop on the Economics of Networks, Systems and Computation , 8 (ACM)
2017
Later among the works it cites.
Akshay Agrawal SD Robin Verschueren, Boyd S (2018) A rewriting system for convex optimization problems. Journal of Control and Decision 5(1):42–60
2018
Later among the works it cites.
Azevedo EM, Budish E (2018) Strategy-proofness in the large. The Review of Economic Studies 86(1):81–116
2018
Later among the works it cites.
Brown N, Sandholm T (2018) Superhuman ai for heads-up no-limit poker: Libratus beats top professionals. Science 359(6374):418–424
2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
Kroer C, Sandholm T (2014) Extensive-form game abstraction with bounds. Proceedings of the fifteenth ACM conference on Economics and computation , 621–638 (ACM)
2014
Cited alongside, same era.
Waugh K, Zinkevich M, Johanson M, Kan M, Schnizlein D, Bowling MH (2009) A practical use of imperfect recall. Proceedings of the Eighth Symposium on Abstraction, Reformulation, and Approximation (SARA’09)
2014
Cited alongside, same era.
Bauckhage C (2015) K-means clustering is matrix factorization. arXiv preprint arXiv:1512.07548
2015
Cited alongside, same era.
Brown N, Ganzfried S, Sandholm T (2015) Hierarchical abstraction, distributed equilibrium computation, and post-processing, with application to a champion no-limit texas hold’em agent. Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems , 7–15 (International Foundation for Autonomous Agents and Multiagent Systems)
2015
Cited alongside, same era.
Goldman J, Procaccia AD (2015) Spliddit: Unleashing fair division algorithms. ACM SIGecom Exchanges 13(2):41–46
2015
Cited alongside, same era.
Harper FM, Konstan JA (2015) The movielens datasets: History and context. ACM Trans. Interact. Intell. Syst. 5(4)
2015
Cited alongside, same era.
Lu T, Boutilier C (2015) Value-directed compression of large-scale assignment problems. Twenty-Ninth AAAI Conference on Artificial Intelligence
2015
Cited alongside, same era.
Later among the works it cites.
Cole R, Gkatzelis V (2018) Approximating the Nash social welfare with indivisible items. SIAM Journal on Computing 47(3):1211–1236
2018
Later among the works it cites.
Feng Z, Narasimhan H, Parkes DC (2018) Deep learning for revenue-optimal auctions with budgets. Proceedings of the 17th International Conference on Autonomous Agents and Multiagent Systems , 354–362 (International Foundation for Autonomous Agents and Multiagent Systems)
2018
Later among the works it cites.
Golowich N, Narasimhan H, Parkes DC (2018) Deep learning for multi-facility location mechanism design. Proceedings of the 27th International Joint Conference on Artificial Intelligence , 261–267, IJCAI’18 (AAAI Press)
2018
Later among the works it cites.
Klemperer P (2018) Auctions: theory and practice (Princeton University Press)
2018
Later among the works it cites.
Kroer C, Sandholm T (2018) A unified framework for extensive-form game abstraction with bounds. Advances in Neural Information Processing Systems , 612–623
2018
Later among the works it cites.
Ljungqvist L, Sargent TJ (2018) Recursive macroeconomic theory (MIT press)
2018
Later among the works it cites.
Nesterov Y, Shikhman V (2018) Computation of Fisher–gale equilibrium by auction. Journal of the Operations Research Society of China 6(3):349–389
2018
Later among the works it cites.
Baldwin E, Klemperer P (2019) Understanding preferences: “demand types”, and the existence of equilibrium with indivisibilities. Econometrica 87(3):867–932
2019
Closest in time.
Bichler M, Waldherr S (2019) Computing core-stable outcomes in combinatorial exchanges with financially constrained bidders. Proceedings of the 2019 ACM Conference on Economics and Computation , 747–747
2019
Closest in time.
Brown N, Lerer A, Gross S, Sandholm T (2019) Deep counterfactual regret minimization. Chaudhuri K, Salakhutdinov R, eds., Proceedings of the 36th International Conference on Machine Learning, ICML 2019, 9-15 June 2019, Long Beach, California, USA , volume 97 of Proceedings of Machine Learning Research , 793–802 (PMLR)
2019
Closest in time.
Conitzer V, Kroer C, Panigrahi D, Schrijvers O, Sodomka E, Stier-Moses NE, Wilkens C (2019) Pacing equilibrium in first-price auction markets. Proceedings of the 2019 ACM Conference on Economics and Computation , 587, EC ’19 (New York, NY, USA: Association for Computing Machinery)
2019
Closest in time.
Johnson J, Douze M, Jégou H (2019) Billion-scale similarity search with GPUs. IEEE Transactions on Big Data 1–1
2019
Closest in time.
Lerer A, Peysakhovich A (2019) Learning social conventions in Markov games. Conference on Artificial Intelligence, Ethics, and Society
2019
Closest in time.
Peysakhovich A, Kroer C, Lerer A (2019) Robust multi-agent counterfactual prediction. Advances in Neural Information Processing Systems , 3077–3087
2019
Closest in time.
Bichler M, Fichtl M, Schwarz G (2020) Walrasian equilibria from an optimization perspective: A guide to the literature. Naval Research Logistics (NRL)
2020
Closest in time.
Garg N, Goel A, Plaut B (2020) Markets for public decision-making. Social Choice and Welfare
2020
Closest in time.
Leme RP, Wong SCw (2020) Computing Walrasian equilibria: Fast algorithms and structural properties. Mathematical Programming 179(1):343–384
2020
Closest in time.
Murray R, Kroer C, Peysakhovich A, Shah P (2020) Robust market equilibria with uncertain preferences. Proceedings of the AAAI Conference on Artificial Intelligence , volume 34, 2192–2199 (AAAI Press)
2020
Closest in time.
Ruiz FJ, Athey S, Blei DM (2020) Shopper: A probabilistic model of consumer choice with substitutes and complements. Annals of Applied Statistics 14(1):1–27
2020
Closest in time.
Andersen M, Dahl J, Vandenberghe L (2013) Cvxopt: A Python package for convex optimization. http://abel.ee.ucla.edu/cvxopt . Last accessed April 2021
2021
Closest in time.
Conitzer V, Kroer C, Sodomka E, Stier-Moses NE (2021) Multiplicative pacing equilibria in auction markets. Operations Research Forthcoming
2021
Closest in time.
Gao Y, Kroer C (2021) Infinite-dimensional Fisher markets: Equilibrium, duality and optimization. Proceedings of the AAAI Conference on Artificial Intelligence
2021
Closest in time.