:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Kamiyama, Naoyuki
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2408.16271
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Non-uniformly Stable Common Independent Sets
by: Kamiyama, Naoyuki
Published: (2026)

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

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

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

The Strongly Stable Roommates Problem and Linear Programming
by: Kamiyama, Naoyuki
Published: (2025)

A Linear Programming Approach to the Super-Stable Roommates Problem
by: Kamiyama, Naoyuki
Published: (2025)

Two-Sided Fairness in Many-to-One Matching
by: Igarashi, Ayumi, et al.
Published: (2025)

Reforming an Unfair Allocation by Exchanging Goods
by: Yuen, Sheung Man, et al.
Published: (2024)

Reachability of Fair Allocations via Sequential Exchanges
by: Igarashi, Ayumi, et al.
Published: (2023)

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

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

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

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

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

Stable Matchings in Practice: A Constraint Programming Approach
by: Sun, Zhaohong, et al.
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)

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

Near-Feasible Solutions to Complex Stable Matching Problems
by: Csáji, Gergely
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)

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)

Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
by: Glitzner, Frederik, et al.
Published: (2025)

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

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

Fairly Dividing Non-identical Random Items: Just Sample or Match
by: Kale, Aprup, et al.
Published: (2025)

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

Stable Matching with Interviews
by: Ashlagi, Itai, et al.
Published: (2025)

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

Stable Matching with Ties: Approximation Ratios and Learning
by: Lin, Shiyun, et al.
Published: (2024)

Strategic Voting in the Context of Stable-Matching of Teams
by: Schmerler, Leora, et al.
Published: (2022)

Revenue Non-monotonicity in Matching Markets
by: Hartline, Jason
Published: (2026)

Capacity Planning in Stable Matching
by: Bobbio, Federico, et al.
Published: (2021)

Stable Matching with Deviators and Conformists
by: Glitzner, Frederik, et al.
Published: (2026)

Two-Sided Manipulation Games in Stable Matching Markets
by: Hosseini, Hadi, et al.
Published: (2025)

A Stable Matching Assignment for Cancer Treatment Centers using Survival Analysis
by: Seidi, Navid
Published: (2024)

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

Learning Optimal Stable Matches in Decentralized Markets with Unknown Preferences
by: Shah, Vade, et al.
Published: (2024)