Saved in:
| Main Authors: | Csáji, Gergely, Glitzner, Frederik |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2310.12269 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Popular and Dominant Matchings with Uncertain, Multilayer and Aggregated Preferences
by: Csáji, Gergely
Published: (2023)
by: Csáji, Gergely
Published: (2023)
Popularity and Perfectness in One-sided Matching Markets with Capacities
by: Csáji, Gergely
Published: (2024)
by: Csáji, Gergely
Published: (2024)
Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
by: Csáji, Gergely
Published: (2024)
by: Csáji, Gergely
Published: (2024)
Popular Maximum-Utility Matchings with Matroid Constraints
by: Csáji, Gergely, et al.
Published: (2024)
by: Csáji, Gergely, et al.
Published: (2024)
Robust Popular Matchings
by: Bullinger, Martin, et al.
Published: (2024)
by: Bullinger, Martin, et al.
Published: (2024)
Near-Feasible Solutions to Complex Stable Matching Problems
by: Csáji, Gergely
Published: (2025)
by: Csáji, Gergely
Published: (2025)
Near-Feasible Stable Matchings: Incentives and Optimality
by: Glitzner, Frederik
Published: (2026)
by: Glitzner, Frederik
Published: (2026)
Stable Matching with Deviators and Conformists
by: Glitzner, Frederik, et al.
Published: (2026)
by: Glitzner, Frederik, et al.
Published: (2026)
Maximally Diverse Stable Matchings: Optimizing Arbitrary Institutional Objectives
by: Csáji, Gergely, et al.
Published: (2026)
by: Csáji, Gergely, et al.
Published: (2026)
A Minimax Perspective on Almost-Stable Matchings
by: Glitzner, Frederik, et al.
Published: (2026)
by: Glitzner, Frederik, et al.
Published: (2026)
Maximum Stable Matching with Matroids and Partial Orders
by: Csáji, Gergely, et al.
Published: (2022)
by: Csáji, Gergely, et al.
Published: (2022)
Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
by: Glitzner, Frederik, et al.
Published: (2025)
by: Glitzner, Frederik, et al.
Published: (2025)
Stable Hypergraph Matching in Unimodular Hypergraphs
by: Biró, Péter, et al.
Published: (2025)
by: Biró, Péter, et al.
Published: (2025)
On Robust Popular Matchings with Tie-Bounded Preferences and Stable Matchings with Two-Sided Ties
by: De, Koustav
Published: (2025)
by: De, Koustav
Published: (2025)
MATWA: A Web Toolkit for Matching under Preferences
by: Glitzner, Frederik, et al.
Published: (2024)
by: Glitzner, Frederik, et al.
Published: (2024)
Optimal Capacity Modification for Many-To-One Matching Problems
by: Chen, Jiehua, et al.
Published: (2023)
by: Chen, Jiehua, et al.
Published: (2023)
Ex-post Stability under Two-Sided Matching: Complexity and Characterization
by: Aziz, Haris, et al.
Published: (2024)
by: Aziz, Haris, et al.
Published: (2024)
Core-Stable Kidney Exchange via Altruistic Donors
by: Csáji, Gergely, et al.
Published: (2026)
by: Csáji, Gergely, et al.
Published: (2026)
The NTU Partitioned Matching Game for International Kidney Exchange Programs
by: Csáji, Gergely, et al.
Published: (2024)
by: Csáji, Gergely, et al.
Published: (2024)
Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
by: Glitzner, Frederik, et al.
Published: (2024)
by: Glitzner, Frederik, et al.
Published: (2024)
Perspectives on Unsolvability in the Roommates Problem
by: Glitzner, Frederik, et al.
Published: (2025)
by: Glitzner, Frederik, et al.
Published: (2025)
The Set of Stable Matchings and the Core in a Matching Market with Ties and Matroid Constraints
by: Kamiyama, Naoyuki
Published: (2024)
by: Kamiyama, Naoyuki
Published: (2024)
The Popular Dimension of Matchings
by: Connor, Frank, et al.
Published: (2025)
by: Connor, Frank, et al.
Published: (2025)
Stable Matching with Ties: Approximation Ratios and Learning
by: Lin, Shiyun, et al.
Published: (2024)
by: Lin, Shiyun, et al.
Published: (2024)
Optimal Capacity Modification for Stable Matchings with Ties
by: Ranjan, Keshav, et al.
Published: (2024)
by: Ranjan, Keshav, et al.
Published: (2024)
Modifying an Instance of the Super-Stable Matching Problem
by: Kamiyama, Naoyuki
Published: (2024)
by: Kamiyama, Naoyuki
Published: (2024)
A Simple 1.5-Approximation Algorithm for a Wide Range of Max-SMTI Problems
by: Csáji, Gergely
Published: (2023)
by: Csáji, Gergely
Published: (2023)
On the Equivalence of the Graph-Structural and Optimization-Based Characterizations of Popular Matchings
by: Kanaya, Yuga, et al.
Published: (2025)
by: Kanaya, Yuga, et al.
Published: (2025)
Popularity in location games
by: Fournier, Gaëtan, et al.
Published: (2024)
by: Fournier, Gaëtan, et al.
Published: (2024)
The Distortion of Stable Matching
by: Filos-Ratsikas, Aris, et al.
Published: (2026)
by: Filos-Ratsikas, Aris, et al.
Published: (2026)
Stable Matching Games
by: Garrido-Lucero, Felipe, et al.
Published: (2020)
by: Garrido-Lucero, Felipe, et al.
Published: (2020)
Smart Lotteries in School Choice: Ex-ante Pareto-Improvement with Ex-post Stability
by: Aziz, Haris, et al.
Published: (2026)
by: Aziz, Haris, et al.
Published: (2026)
Non-uniformly Stable Matchings
by: Kamiyama, Naoyuki
Published: (2024)
by: Kamiyama, Naoyuki
Published: (2024)
Capacity Modification in the Stable Matching Problem
by: Gokhale, Salil, et al.
Published: (2024)
by: Gokhale, Salil, et al.
Published: (2024)
The Strongly Stable Matching Problem with Closures
by: Kamiyama, Naoyuki
Published: (2024)
by: Kamiyama, Naoyuki
Published: (2024)
Efficient Interview Scheduling for Stable Matching
by: Babaioff, Moshe, et al.
Published: (2026)
by: Babaioff, Moshe, et al.
Published: (2026)
Stable Matching under Matroid Rank Valuations
by: Eden, Alon, et al.
Published: (2025)
by: Eden, Alon, et al.
Published: (2025)
Robust Stable Matchings: Dealing with Changes in Preferences
by: Gangam, Rohith Reddy, et al.
Published: (2026)
by: Gangam, Rohith Reddy, et al.
Published: (2026)
Fragile Stable Matchings
by: Rudov, Kirill
Published: (2024)
by: Rudov, Kirill
Published: (2024)
Persuading Stable Matching
by: Shaki, Jonathan, et al.
Published: (2025)
by: Shaki, Jonathan, et al.
Published: (2025)
Similar Items
-
Popular and Dominant Matchings with Uncertain, Multilayer and Aggregated Preferences
by: Csáji, Gergely
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) -
Popular Maximum-Utility Matchings with Matroid Constraints
by: Csáji, Gergely, et al.
Published: (2024) -
Robust Popular Matchings
by: Bullinger, Martin, et al.
Published: (2024)