Online Nash welfare maximization without predictions

DOI10.1007/978-3-031-48974-7_23MaRDI QIDQ6609160

Zhi-Yi Huang, Unnamed Author, Tianze Wei, Minming Li

Publication date: 20 September 2024

zbMATH Keywords

online algorithmfair divisionNash welfare

Mathematics Subject Classification ID

Applications of game theory (91A80) Auctions, bargaining, bidding and selling, and other market models (91B26) Internet topics (68M11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Splitting necklaces
• APX-hardness of maximizing Nash social welfare with indivisible items
• Bayesian Mechanism Design
• Approximating the Nash Social Welfare with Indivisible Items
• A general approach to online network optimization problems
• The Bargaining Problem
• Online Primal-Dual Algorithms for Covering and Packing
• Consensus of Subjective Probabilities: The Pari-Mutuel Method
• How to Allocate Goods in an Online Market?
• How to Cut A Cake Fairly
• The Nash Social Welfare Function
• Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
• Nash Social Welfare, Matrix Permanent, and Stable Polynomials
• Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
• Online matching with concave returns
• Online Nash social welfare maximization with predictions

This page was built for publication: Online Nash welfare maximization without predictions