Imagen de Portada

A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Csáji, Gergely
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms Discrete Mathematics Computer Science and Game Theory Multiagent Systems
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Non-Exclusive Notifications for Ride-Hailing at Lyft I: Single-Cycle Approximation Algorithms
por: Ekbatani, Farbod, et al.
Publicado: (2026)

Approximately Envy-free and Equitable Allocations of Indivisible Items for Non-monotone Valuations
por: Bilò, Vittorio, et al.
Publicado: (2025)

Approximately Dominating Sets in Elections
por: Charikar, Moses, et al.
Publicado: (2025)

Primal-Dual Algorithms with Predictions for Online Bounded Allocation and Ad-Auctions Problems
por: Kevi, Eniko, et al.
Publicado: (2024)

Improved MMS Approximations for Few Agent Types
por: Garg, Jugal, et al.
Publicado: (2025)

Distortion of Metric Voting with Bounded Randomness
por: Cai, Ziyi, et al.
Publicado: (2026)

Monotone Randomized Apportionment
por: Correa, José, et al.
Publicado: (2024)

Some variations of the secretary problem
por: Agrawal, Sarthak, et al.
Publicado: (2026)

Unbalanced Random Matching Markets with Partial Preferences
por: Potukuchi, Aditya, et al.
Publicado: (2024)

Generalized Nash Equilibrium Problems with Mixed-Integer Variables
por: Harks, Tobias, et al.
Publicado: (2021)

Six Candidates Suffice to Win a Voter Majority
por: Charikar, Moses, et al.
Publicado: (2024)

The Popular Dimension of Matchings
por: Connor, Frank, et al.
Publicado: (2025)

A Unified Model of Congestion Games with Priorities: Two-Sided Markets with Ties, Finite and Non-Affine Delay Functions, and Pure Nash Equilibria
por: Takazawa, Kenjiro
Publicado: (2024)

Stationary Online Contention Resolution Schemes
por: Aminian, Mohammad Reza, et al.
Publicado: (2026)

Maximizing Value in Challenge the Champ Tournaments
por: Bhaskar, Umang, et al.
Publicado: (2025)

Adaptive Manipulation for Coalitions in Knockout Tournaments
por: Chaudhary, Juhi, et al.
Publicado: (2024)

Equilibria in multiagent online problems with predictions
por: Istrate, Gabriel, et al.
Publicado: (2024)

EFX Exists for Three Types of Agents
por: HV, Vishwa Prakash, et al.
Publicado: (2024)

Online Fair Division: Towards Ex-Post Constant MMS Guarantees
por: Kulkarni, Pooja, et al.
Publicado: (2025)

Leakage-Robust Bayesian Persuasion
por: Haghtalab, Nika, et al.
Publicado: (2024)

Fairly Wired: Towards Leximin-Optimal Division of Electricity
por: Hartman, Eden, et al.
Publicado: (2025)

Platforms for Efficient and Incentive-Aware Collaboration
por: Haghtalab, Nika, et al.
Publicado: (2024)

Group Fair Matchings using Convex Cost Functions
por: Panda, Atasi, et al.
Publicado: (2025)

Reducing Leximin Fairness to Utilitarian Optimization
por: Hartman, Eden, et al.
Publicado: (2024)

Popularity and Perfectness in One-sided Matching Markets with Capacities
por: Csáji, Gergely
Publicado: (2024)

Approximating maximum-size properly colored forests
por: Bai, Yuhang, et al.
Publicado: (2024)

Breaking the Metric Voting Distortion Barrier
por: Charikar, Moses, et al.
Publicado: (2023)

Combinatorial Bernoulli Factories
por: Niazadeh, Rad, et al.
Publicado: (2020)

Stable Hypergraph Matching in Unimodular Hypergraphs
por: Biró, Péter, et al.
Publicado: (2025)

Scheduling with Time Dependent Utilities: Fairness and Efficiency
por: Nicosia, Gaia, et al.
Publicado: (2026)

The NTU Partitioned Matching Game for International Kidney Exchange Programs
por: Csáji, Gergely, et al.
Publicado: (2024)

Optimal Capacity Modification for Many-To-One Matching Problems
por: Chen, Jiehua, et al.
Publicado: (2023)

Robust Popular Matchings
por: Bullinger, Martin, et al.
Publicado: (2024)

The Secretary Problem with Predictions and a Chosen Order
por: Karisani, Helia, et al.
Publicado: (2026)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
por: Nanta, Jiratchaphat, et al.
Publicado: (2025)

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
por: Hummel, Halvard, et al.
Publicado: (2024)

Approximation Algorithm of Minimum All-Ones Problem for Arbitrary Graphs
por: Wang, Chen, et al.
Publicado: (2024)

Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples
por: Csáji, Gergely, et al.
Publicado: (2023)

The Min Max Average Cycle Weight Problem
por: Elmalem, Noga Klein, et al.
Publicado: (2025)