:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Csáji, Gergely
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2502.02503
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Weakly-Popular and Super-Popular Matchings with Ties and Their Connection to Stable Matchings
by: Csáji, Gergely, et al.
Published: (2023)

Maximally Diverse Stable Matchings: Optimizing Arbitrary Institutional Objectives
by: Csáji, Gergely, et al.
Published: (2026)

Popular and Dominant Matchings with Uncertain, Multilayer and Aggregated Preferences
by: Csáji, Gergely
Published: (2023)

Maximum Stable Matching with Matroids and Partial Orders
by: Csáji, Gergely, et al.
Published: (2022)

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

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

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

Ex-post Stability under Two-Sided Matching: Complexity and Characterization
by: Aziz, Haris, et al.
Published: (2024)

Core-Stable Kidney Exchange via Altruistic Donors
by: Csáji, Gergely, et al.
Published: (2026)

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

Popular Maximum-Utility Matchings with Matroid Constraints
by: Csáji, Gergely, et al.
Published: (2024)

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

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

Robust Popular Matchings
by: Bullinger, Martin, et al.
Published: (2024)

Near-Feasible Stable Matchings: Incentives and Optimality
by: Glitzner, Frederik
Published: (2026)

Smart Lotteries in School Choice: Ex-ante Pareto-Improvement with Ex-post Stability
by: Aziz, Haris, et al.
Published: (2026)

Computing Balanced Solutions for Large International Kidney Exchange Schemes When Cycle Length Is Unbounded
by: Benedek, Márton, et al.
Published: (2023)

Capacity Modification in the Stable Matching Problem
by: Gokhale, Salil, et al.
Published: (2024)

The Strongly Stable Matching Problem with Closures
by: Kamiyama, Naoyuki
Published: (2024)

Modifying an Instance of the Super-Stable Matching Problem
by: Kamiyama, Naoyuki
Published: (2024)

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

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

FPT-Approximability of Stable Matching Problems
by: Chen, Jiehua, et al.
Published: (2025)

Worst- and Average-Case Robustness of Stable Matchings: (Counting) Complexity and Experiments
by: Boehmer, Kimon, et al.
Published: (2024)

The Distortion of Stable Matching
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

Stable Matching Games
by: Garrido-Lucero, Felipe, et al.
Published: (2020)

Uber Stable: Formulating the Rideshare System as a Stable Matching Problem
by: Acharya, Rhea, et al.
Published: (2024)

Non-uniformly Stable Matchings
by: Kamiyama, Naoyuki
Published: (2024)

Efficient Interview Scheduling for Stable Matching
by: Babaioff, Moshe, et al.
Published: (2026)

Stable Menus of Public Goods: A Matching Problem
by: Fish, Sara, et al.
Published: (2024)

The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid Constraints
by: Kamiyama, Naoyuki
Published: (2024)

Stable Matching under Matroid Rank Valuations
by: Eden, Alon, et al.
Published: (2025)

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

Control in Stable Marriage and Stable Roommates: Complexity and Algorithms
by: Chen, Jiehua, et al.
Published: (2025)

The Cyber Alliance Game: How Alliances Influence Cyber-Warfare
by: Benkő, Gergely, et al.
Published: (2024)

Finding Personalized Good-Enough Solutions to Unsatisfiable Stable Roommates Problems
by: Fidan, Müge, et al.
Published: (2025)

Fast, Fair and Truthful Distributed Stable Matching for Common Preferences
by: Hirvonen, Juho, et al.
Published: (2024)

Robustness of Stable Matchings When Attributes and Salience Determine Preferences
by: Ronen, Amit, et al.
Published: (2026)

Persuading Stable Matching
by: Shaki, Jonathan, et al.
Published: (2025)

Fragile Stable Matchings
by: Rudov, Kirill
Published: (2024)