Image de couverture de livre

Improved MMS Approximations for Few Agent Types

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Garg, Jugal, Shahkar, Parnian
Format:	Preprint
Publié:	2025
Sujets:	Computer Science and Game Theory Data Structures and Algorithms Multiagent Systems
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Online Fair Division: Towards Ex-Post Constant MMS Guarantees
par: Kulkarni, Pooja, et autres
Publié: (2025)

Welfare Approximation in Additively Separable Hedonic Games
par: Bullinger, Martin, et autres
Publié: (2025)

EFX Exists for Three Types of Agents
par: HV, Vishwa Prakash, et autres
Publié: (2024)

Robust Popular Matchings
par: Bullinger, Martin, et autres
Publié: (2024)

Maximizing Value in Challenge the Champ Tournaments
par: Bhaskar, Umang, et autres
Publié: (2025)

Fairly Wired: Towards Leximin-Optimal Division of Electricity
par: Hartman, Eden, et autres
Publié: (2025)

Group Fair Matchings using Convex Cost Functions
par: Panda, Atasi, et autres
Publié: (2025)

Adaptive Manipulation for Coalitions in Knockout Tournaments
par: Chaudhary, Juhi, et autres
Publié: (2024)

Equilibria in multiagent online problems with predictions
par: Istrate, Gabriel, et autres
Publié: (2024)

Leakage-Robust Bayesian Persuasion
par: Haghtalab, Nika, et autres
Publié: (2024)

Platforms for Efficient and Incentive-Aware Collaboration
par: Haghtalab, Nika, et autres
Publié: (2024)

Reducing Leximin Fairness to Utilitarian Optimization
par: Hartman, Eden, et autres
Publié: (2024)

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
par: Csáji, Gergely
Publié: (2023)

Approximating Nash Social Welfare by Matching and Local Search
par: Garg, Jugal, et autres
Publié: (2022)

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
par: Csáji, Gergely
Publié: (2024)

A Strongly Polynomial Algorithm for Arctic Auctions
par: Garg, Jugal, et autres
Publié: (2026)

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
par: Hummel, Halvard, et autres
Publié: (2024)

Logarithmic Approximation for Road Pricing on Grids
par: Constantinescu, Andrei, et autres
Publié: (2025)

An FPTAS for 7/9-Approximation to Maximin Share Allocations
par: Huang, Xin, et autres
Publié: (2025)

How Hard Is It to Rig a Tournament When Few Players Can Beat or Be Beaten by the Favorite?
par: Wang, Zhonghao, et autres
Publié: (2026)

More Efforts Towards Fixed-Parameter Approximability of Multiwinner Rules
par: Gupta, Sushmita, et autres
Publié: (2025)

Beyond the Half-Approximation: Fair and Efficient Online Class Matching
par: Borst, Sander, et autres
Publié: (2026)

Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
par: Segev, Danny, et autres
Publié: (2020)

Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
par: Feng, Yuda, et autres
Publié: (2024)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
par: Bei, Xiaohui, et autres
Publié: (2025)

A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
par: Feng, Yuda, et autres
Publié: (2024)

Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
par: Andersen, Martin Jupakkal, et autres
Publié: (2025)

Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More
par: Bowers, Robin, et autres
Publié: (2025)

Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
par: Brown, Adam, et autres
Publié: (2024)

Improved Parallel Algorithms for EF1 Allocations
par: Gowda, Kishen N, et autres
Publié: (2026)

Truthful Matching with Online Items and Offline Agents
par: Feldman, Michal, et autres
Publié: (2022)

Setting Targets is All You Need:Improved Order Competitive Ratio for Online Selection
par: Chen, Liyan, et autres
Publié: (2024)

Approximately Bisubmodular Regret Minimization in Billboard and Social Media Advertising
par: Ali, Dildar, et autres
Publié: (2025)

Almost and Approximate EFX for Few Types of Agents
par: HV, Vishwa Prakash, et autres
Publié: (2025)

Covering a Few Submodular Constraints and Applications
par: Bajpai, Tanvi, et autres
Publié: (2025)

Online Combinatorial Allocations and Auctions with Few Samples
par: Dütting, Paul, et autres
Publié: (2024)

Procurement Auctions via Approximately Optimal Submodular Optimization
par: Deng, Yuan, et autres
Publié: (2024)

Best of Both Worlds Guarantees for Equitable Allocations
par: Bhaskar, Umang, et autres
Publié: (2025)

Universal Online Contention Resolution with Preselected Order
par: Zhao, Junyao
Publié: (2025)

The Min Max Average Cycle Weight Problem
par: Elmalem, Noga Klein, et autres
Publié: (2025)