Proportionally Fair Online Allocation of Public Goods with Predictions
暂无分享,去创建一个
[1] Nisarg Shah,et al. Efficient Resource Allocation with Secretive Agents , 2022, IJCAI.
[2] Nisarg Shah,et al. Optimized Distortion and Proportional Fairness in Voting , 2022, EC.
[3] Rong Ge,et al. A Regression Approach to Learning-Augmented Online Algorithms , 2022, NeurIPS.
[4] Virginie Do,et al. Online Approval Committee Elections , 2022, IJCAI.
[5] Christian Coester,et al. Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds , 2021, NeurIPS.
[6] Kamesh Munagala,et al. Approximate Core for Committee Selection via Multilinear Extension and Market Clearing , 2021, SODA.
[7] Adam Wierman,et al. Pareto-Optimal Learning-Augmented Algorithms for Online Conversion Problems , 2021, NeurIPS.
[8] Siddharth Barman,et al. Universal and Tight Online Algorithms for Generalized-Mean Welfare , 2021, AAAI.
[9] Jugal Garg,et al. On Fair and Efficient Allocations of Indivisible Public Goods , 2021, FSTTCS.
[10] Sergei Vassilvitskii,et al. Faster Matchings via Learned Duals , 2021, NeurIPS.
[11] Felix Brandt,et al. Distribution Rules Under Dichotomous Preferences: Two Out of Three Ain't Bad , 2021, EC.
[12] Kane,et al. Beyond the Worst-Case Analysis of Algorithms , 2020 .
[13] Paul Dütting,et al. Secretaries with Advice , 2020, EC.
[14] Jian Li,et al. Online Algorithms for Multi-shop Ski Rental with Machine Learned Advice , 2020, NeurIPS.
[15] Ola Svensson,et al. Learning Augmented Energy Minimization via Speed Scaling , 2020, NeurIPS.
[16] Ola Svensson,et al. The Primal-Dual method for Learning Augmented Algorithms , 2020, NeurIPS.
[17] Alexandros Psomas,et al. Fair and Efficient Online Allocations with Normalized Valuations , 2020, AAAI.
[18] Dominik Peters,et al. Proportional Participatory Budgeting with Cardinal Utilities , 2020, ArXiv.
[19] Siddhartha Banerjee,et al. Online Nash Social Welfare Maximization with Predictions , 2020, SODA.
[20] Ariel D. Procaccia,et al. Fair Division with Binary Valuations: One Rule to Rule Them All , 2020, WINE.
[21] Sergei Vassilvitskii,et al. Algorithms with predictions , 2020, Beyond the Worst-Case Analysis of Algorithms.
[22] Yisong Yue,et al. The Power of Predictions in Online Control , 2020, NeurIPS.
[23] Debmalya Panigrahi,et al. Online Algorithms for Weighted Paging with Predictions , 2020, ICALP.
[24] A. Antoniadis,et al. Secretary and Online Matching Problems with Machine Learned Advice , 2020, NeurIPS.
[25] Martin Lackner,et al. Perpetual Voting: Fairness in Long-Term Decision Making , 2020, AAAI.
[26] Christian Coester,et al. Online Metric Algorithms with Untrusted Predictions , 2020, ICML.
[27] Haris Aziz,et al. Participatory Budgeting: Models and Approaches , 2020, Pathways Between Social Science and Computational Social Science.
[28] Dhruv Rohatgi,et al. Near-Optimal Bounds for Online Caching with Machine Learned Advice , 2019, SODA.
[29] David Zeng,et al. Fairness-Efficiency Tradeoffs in Dynamic Fair Division , 2019, EC.
[30] Scott Shenker,et al. Fair and Efficient Memory Sharing: Confronting Free Riders , 2019, AAAI.
[31] Artur Gorokh,et al. The Remarkable Robustness of the Repeated Fisher Market , 2019, EC.
[32] Na Li,et al. Online Optimal Control with Linear Dynamics and Predictions: Algorithms and Regret Analysis , 2019, NeurIPS.
[33] Bo Li,et al. Strategyproof and Approximately Maxmin Fair Share Allocation of Chores , 2019, IJCAI.
[34] Hervé Moulin,et al. A simple Online Fair Division problem , 2019, ArXiv.
[35] Renato Paes Leme,et al. Dynamic Double Auctions: Toward First Best , 2019, SODA.
[36] Ariel D. Procaccia,et al. How to Make Envy Vanish Over Time , 2018, EC.
[37] Kamesh Munagala,et al. Fair Allocation of Indivisible Public Goods , 2018, EC.
[38] Sergei Vassilvitskii,et al. Competitive caching with machine learned advice , 2018, ICML.
[39] Haris Aziz,et al. Fair Mixing: the Case of Dichotomous Preferences , 2017, EC.
[40] Vincent Conitzer,et al. Fair and Efficient Social Choice in Dynamic Settings , 2017, IJCAI.
[41] Siddhartha Banerjee,et al. From Monetary to Non-Monetary Mechanism Design via Artificial Currencies , 2017, EC.
[42] Evangelos Markakis,et al. Truthful Allocation Mechanisms Without Payments: Characterization and Implications on Fairness , 2017, EC.
[43] Vincent Conitzer,et al. Fair Public Decision Making , 2016, EC.
[44] Kamesh Munagala,et al. The Core of the Participatory Budgeting Problem , 2016, WINE.
[45] Simina Brânzei,et al. Nash Social Welfare Approximation for Strategic Agents , 2016, EC.
[46] Kamesh Munagala,et al. ROBUS: Fair Cache Allocation for Data-parallel Workloads , 2015, SIGMOD Conference.
[47] Raphaël Clifford,et al. ACM-SIAM Symposium on Discrete Algorithms , 2015, SODA 2015.
[48] Joel Oren,et al. Online (Budgeted) Social Choice , 2014, AAAI.
[49] Nikhil R. Devanur,et al. Online matching with concave returns , 2012, STOC '12.
[50] Toniann Pitassi,et al. Proceedings of the forty-fourth annual ACM symposium on Theory of computing , 2012, STOC 2012.
[51] Y. Azar,et al. How to Allocate Goods in an Online Market? , 2010, Algorithmica.
[52] Vincent Conitzer,et al. Competitive Repeated Allocation without Payments , 2009, WINE.
[53] Joseph Naor,et al. The Design of Competitive Online Algorithms via a Primal-Dual Approach , 2009, Found. Trends Theor. Comput. Sci..
[54] Richard Stong,et al. Collective choice under dichotomous preferences , 2005, J. Econ. Theory.
[55] Frank Kelly,et al. Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..
[56] E. Olson. A FAIR ALLOCATION , 1967 .
[57] J. Nash. THE BARGAINING PROBLEM , 1950, Classics in Game Theory.
[58] Nisarg Shah,et al. Proportionally Fair Online Allocation of Public Goods , 2022 .
[59] Mahshid Montazer Qaem,et al. Online Knapsack with Frequency Predictions , 2021, NeurIPS.
[60] A. Panconesi,et al. Online Facility Location with Multiple Advice , 2021, NeurIPS.
[61] Proceedings of the 22nd ACM Conference on Economics and Computation , 2021 .
[62] Soumya Banerjee,et al. Improving Online Rent-or-Buy Algorithms with Sequential Decision Making and ML Predictions , 2020, NeurIPS.
[63] Silvio Lattanzi,et al. Online Scheduling via Learned Weights , 2020, SODA.
[64] Google,et al. Improving Online Algorithms via ML Predictions , 2024, NeurIPS.
[65] Jose M. Such,et al. International Joint Conference on Artificial Intelligence (IJCAI) , 2016 .
[66] Conal Duddy,et al. Fair sharing under dichotomous preferences , 2015, Math. Soc. Sci..
[67] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[68] Duncan K. Foley,et al. Lindahl's Solution and the Core of an Economy with Public Goods , 1970 .