暂无分享,去创建一个
[1] Yair Zick,et al. A Learning Framework for Distribution-Based Game-Theoretic Solution Concepts , 2019, EC.
[2] E. Eisenberg. Aggregation of Utility Functions , 1961 .
[3] Maria-Florina Balcan,et al. A General Theory of Sample Complexity for Multi-Item Profit Maximization , 2017, EC.
[4] Venkatesan Guruswami,et al. On profit-maximizing envy-free pricing , 2005, SODA '05.
[5] Alexander Peysakhovich,et al. Computing Large Market Equilibria using Abstractions , 2019, EC.
[6] Nikhil R. Devanur,et al. The sample complexity of auctions with side information , 2015, STOC.
[7] Tim Roughgarden,et al. On the Pseudo-Dimension of Nearly Optimal Auctions , 2015, NIPS.
[8] Faruk Gul,et al. WALRASIAN EQUILIBRIUM WITH GROSS SUBSTITUTES , 1999 .
[9] Sven Seuken,et al. Combinatorial Auctions via Machine Learning-based Preference Elicitation , 2018, IJCAI.
[10] D. Gale,et al. Fair Allocation of Indivisible Goods and Criteria of Justice , 1991 .
[11] Ya'akov Gal,et al. Which is the fairest (rent division) of them all? , 2017, IJCAI.
[12] Peter L. Bartlett,et al. Neural Network Learning - Theoretical Foundations , 1999 .
[13] Eric Balkanski,et al. The Sample Complexity of Optimizing a Convex Function , 2017, COLT.
[14] V. Crawford,et al. Job Matching, Coalition Formation, and Gross Substitutes , 1982 .
[15] Renato Paes Leme,et al. Learning to Clear the Market , 2019, ICML.
[16] H. Varian. Equity, Envy and Efficiency , 1974 .
[17] S. Bikhchandani,et al. Competitive Equilibrium in an Exchange Economy with Indivisibilities , 1997 .
[18] Moshe Babaioff,et al. Competitive Equilibria with Indivisible Goods and Generic Budgets , 2017, Math. Oper. Res..
[19] Enriqueta Aragones,et al. A derivation of the money Rawlsian solution , 1995 .
[20] Maria-Florina Balcan,et al. Learning submodular functions , 2010, STOC '11.
[21] Mohammad Taghi Hajiaghayi,et al. Fair Allocation of Indivisible Goods to Asymmetric Agents , 2017, AAMAS.
[22] Erel Segal-Halevi,et al. Competitive Equilibrium For almost All Incomes , 2017, AAMAS.
[23] Amy Greenwald,et al. Learning Competitive Equilibria in Noisy Combinatorial Markets , 2021, AAMAS.
[24] Yair Zick,et al. Forming Probably Stable Communities with Limited Interactions , 2019, AAAI.
[25] Sergei Vassilvitskii,et al. Statistical Cost Sharing , 2017, NIPS.
[26] Simina Brânzei,et al. Characterization and Computation of Equilibria for Indivisible Goods , 2015, SAGT.
[27] Harvard University,et al. Minimizing a Submodular Function from Samples , 2017 .
[28] Richard Cole,et al. The sample complexity of revenue maximization , 2014, STOC.
[29] Parikshit Shah,et al. Robust Market Equilibria with Uncertain Preferences , 2020, AAAI.
[30] Allan Borodin,et al. Budgetary Effects on Pricing Equilibrium in Online Markets , 2016, AAMAS.
[31] Ariel D. Procaccia,et al. When Can the Maximin Share Guarantee Be Guaranteed? , 2016, AAAI.
[32] Siddharth Barman,et al. On the Proximity of Markets with Integral Equilibria , 2018, AAAI.
[33] Simina Brânzei,et al. To Give or Not to Give: Fair Division for Single Minded Valuations , 2016, IJCAI.
[34] Maria-Florina Balcan,et al. Learning Cooperative Games , 2015, IJCAI.
[35] Nikhil R. Devanur,et al. Market equilibrium via a primal--dual algorithm for a convex program , 2008, JACM.
[36] Eric Balkanski,et al. Learning to Optimize Combinatorial Functions , 2018, ICML.
[37] P. Bartlett,et al. Learning Hedonic Games , 2017 .
[38] Eric Budish,et al. The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes , 2010, Journal of Political Economy.