Approximating Nash social welfare under binary XOS and binary subadditive valuations

DOI10.1007/978-3-030-94676-0_21OpenAlexW4225771455MaRDI QIDQ2152132

Paritosh Verma, Siddharth Barman

Publication date: 6 July 2022

Full work available at URL: https://arxiv.org/abs/2106.02656

zbMATH Keywords

Nash social welfarebinary marginalsdiscrete fair division

Mathematics Subject Classification ID

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

Related Items (2)

Improved maximin guarantees for subadditive and fractionally subadditive fair allocation problem ⋮ Weighted fair division with matroid-rank valuations: monotonicity and strategyproofness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximizing Nash product social welfare in allocating indivisible goods
• Earning limits in Fisher markets with spending-constraint utilities
• Pairwise kidney exchange
• APX-hardness of maximizing Nash social welfare with indivisible items
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Finding fair and efficient allocations when valuations don't add up
• Multi-unit assignment under dichotomous preferences
• The fair division of hereditary set systems
• An improved approximation algorithm for maximin shares
• Collective choice under dichotomous preferences
• Fair division with binary valuations: one rule to rule them all
• On maximizing welfare when utility functions are subadditive
• Approximating the Nash Social Welfare with Indivisible Items
• The Bargaining Problem
• Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders
• Fair Enough
• Nash Social Welfare for Indivisible Items under Separable, Piecewise-Linear Concave Utilities
• Nash Social Welfare, Matrix Permanent, and Stable Polynomials
• Fair Allocation of Indivisible Goods: Improvement
• Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
• Algorithmic Game Theory
• Fundamentals of Computation Theory
• Approximating Nash social welfare under rado valuations

This page was built for publication: Approximating Nash social welfare under binary XOS and binary subadditive valuations