Cover Image

Robust Stable Matchings: Dealing with Changes in Preferences

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gangam, Rohith Reddy, Mai, Tung, Raju, Nitya, Vazirani, Vijay V.
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stable Matching: Dealing with Changes in Preferences
by: Gangam, Rohith Reddy, et al.
Published: (2023)

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

Fair Rent Division: New Budget and Rent Constraints
by: Gangam, Rohith Reddy, et al.
Published: (2025)

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

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

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

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

Matching Markets with Chores
by: Garg, Jugal, et al.
Published: (2024)

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

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

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

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

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

A Generalization of von Neumann's Reduction from the Assignment Problem to Zero-Sum Games
by: Adler, Ilan, et al.
Published: (2024)

Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences
by: McCauley, Samuel, et al.
Published: (2026)

Matching with Committee Preferences
by: Song, Haoyu, et al.
Published: (2026)

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

Learning Optimal Stable Matches in Decentralized Markets with Unknown Preferences
by: Shah, Vade, 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)

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

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

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

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

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)

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

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)

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

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

Near-Feasible Solutions to Complex Stable Matching Problems
by: Csáji, Gergely
Published: (2025)

Two-Stage Stochastic Capacity Expansion in Stable Matching under Truthful or Strategic Preference Uncertainty
by: Bazotte, Maria, et al.
Published: (2025)

Evolutionarily Stable Preferences Against Multiple Mutations in Multi-player Games
by: Tu, Yu-Sung, et al.
Published: (2018)

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

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

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

Structure from Strategic Interaction & Uncertainty: Risk Sensitive Games for Robust Preference Learning
by: Horwitz, Max, et al.
Published: (2026)

Stable Matching with Contingent Priorities
by: Rios, Ignacio, et al.
Published: (2024)

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