Cover Image

Matching Markets with Chores

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Garg, Jugal, Tröbst, Thorben, Vazirani, Vijay V.
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Time-Efficient Algorithms for Nash-Bargaining-Based Matching Market Models
by: Panageas, Ioannis, et al.
Published: (2021)

Cardinal-Utility Matching Markets: The Quest for Envy-Freeness, Pareto-Optimality, and Efficient Computability
by: Tröbst, Thorben, et al.
Published: (2024)

A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
by: Li, Bo, et al.
Published: (2024)

A Unified Framework for Weighted Hypergraphic Networks and Fractional Matching
by: Castera, Rémi, et al.
Published: (2026)

On Robust Popular Matchings with Tie-Bounded Preferences and Stable Matchings with Two-Sided Ties
by: De, Koustav
Published: (2025)

Matroid Bayesian Online Selection
by: DeHaan, Ian, et al.
Published: (2024)

Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency
by: Sun, Ankang, et al.
Published: (2024)

Bribery Can Get Harder in Structured Multiwinner Approval Election
by: Kusek, Bartosz, et al.
Published: (2022)

Existence of 2-EFX Allocations of Chores
by: Garg, Jugal, et al.
Published: (2025)

The Complexity of Graph Exploration Games
by: Fuchs, Janosch, et al.
Published: (2023)

A Strongly Polynomial Algorithm for Arctic Auctions
by: Garg, Jugal, et al.
Published: (2026)

Constant-Factor EFX Exists for Chores
by: Garg, Jugal, et al.
Published: (2024)

Proportional and Pareto-Optimal Allocation of Chores with Subsidy
by: Garg, Jugal, et al.
Published: (2025)

Robustness of Approval-Based Multiwinner Voting Rules
by: Faliszewski, Piotr, et al.
Published: (2026)

Selling Privacy in Blockchain Transactions
by: Chionas, Georgios, et al.
Published: (2025)

Improved Maximin Share Approximations for Chores by Bin Packing
by: Garg, Jugal, et al.
Published: (2024)

Weighted EF1 and PO Allocations with Few Types of Agents or Chores
by: Garg, Jugal, et al.
Published: (2024)

Improved Mechanisms and Prophet Inequalities for Graphical Dependencies
by: Livanos, Vasilis, et al.
Published: (2024)

Optimal Portfolio Compression for Priority-Proportional Clearing with Defaulting Costs
by: Csáji, Gergely, et al.
Published: (2026)

High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
by: Bredereck, Robert, et al.
Published: (2020)

A Counterexample to EFX $n \ge 3$ Agents, $m \ge n + 5$ Items, Submodular Valuations via SAT-Solving
by: Akrami, Hannaneh, et al.
Published: (2026)

Fair allocations with subadditive and XOS valuations
by: Feige, Uriel, et al.
Published: (2025)

On MMS, APS and XOS
by: Feige, Uriel, et al.
Published: (2026)

Multidimensional Budget-Feasible Mechanism Design
by: Neogi, Rian, et al.
Published: (2025)

Fair Division Among Couples and Small Groups
by: Gölz, Paul, et al.
Published: (2025)

Equitable Core Imputations for Max-Flow, MST and $b$-Matching Games
by: Gangam, Rohith R., et al.
Published: (2024)

Probabilistic Analysis of Stable Matching in Large Markets with Siblings
by: Sun, Zhaohong, et al.
Published: (2025)

Maps of Tournaments: Distances, Experiments, and Data
by: Nikolow, Filip, et al.
Published: (2026)

Computational Intractability of Strategizing against Online Learners
by: Assos, Angelos, et al.
Published: (2025)

Learning Real-Life Approval Elections
by: Faliszewski, Piotr, et al.
Published: (2026)

On the Core of the $b$-Matching Game
by: Gangam, Rohith Reddy, et al.
Published: (2025)

Arctic Auctions, Linear Fisher Markets, and Rational Convex Programs
by: Vazirani, Vijay V.
Published: (2025)

Search versus Search for Collapsing Electoral Control Types
by: Carleton, Benjamin, et al.
Published: (2022)

Anyone but Him: The Complexity of Precluding an Alternative
by: Hemaspaandra, Edith, et al.
Published: (2005)

A Protocol for Trustless Verification Under Uncertainty
by: Shi, David, et al.
Published: (2025)

Fair Core Imputations for the Assignment Game: New Solution Concepts and Efficient Algorithms
by: Vazirani, Vijay V.
Published: (2024)

Fair distribution of bundles
by: Soberón, Pablo
Published: (2025)

The Complexity of Extending Fair Allocations of Indivisible Goods
by: Deligkas, Argyrios, et al.
Published: (2025)

Robust Stable Matchings: Dealing with Changes in Preferences
by: Gangam, Rohith Reddy, et al.
Published: (2026)

The Exchange Problem
by: Garg, Mohit, et al.
Published: (2024)