:: Library Catalog

Cover Image

Saved in:

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

Similar Items

Non-uniformly Stable Matchings
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)

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)

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)

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

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

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

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

Obvious Independence of Clones
by: Berker, Ratip Emin, et al.
Published: (2022)

Properties of Path-Independent Choice Correspondences and Their Applications to Efficient and Stable Matchings
by: Bando, Keisuke, et al.
Published: (2025)

Verification with Common Knowledge of Rationality for Graph Games
by: Nakanishi, Rindo, et al.
Published: (2024)

Subgame Optimal and Prior-Independent Online Algorithms
by: Hartline, Jason, et al.
Published: (2024)

Fast value iteration: A uniform approach to efficient algorithms for energy games
by: Cadilhac, Michaël, et al.
Published: (2021)

The Complexity of Two-Team Polymatrix Games with Independent Adversaries
by: Hollender, Alexandros, et al.
Published: (2024)

On Robustness to $k$-wise Independence of Optimal Bayesian Mechanisms
by: Gravin, Nick, et al.
Published: (2024)

Common-agency Games for Multi-Objective Test-Time Alignment
by: Chen, Baiting, et al.
Published: (2026)

Arena-Independent Memory Bounds for Nash Equilibria in Reachability Games
by: Main, James C. A.
Published: (2023)

Settling the Competition Complexity of Additive Buyers over Independent Items
by: Derakhshan, Mahsa, et al.
Published: (2024)

Mean-Field Games With Finitely Many Players: Independent Learning and Subjectivity
by: Yongacoglu, Bora, et al.
Published: (2022)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
by: Ghosh, Abheek, et al.
Published: (2024)

Common revenue allocation in DMUs with two stages based on DEA cross-efficiency and cooperative game
by: Wang, Xinyu, et al.
Published: (2024)

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

Independence of Approximate Clones
by: Delemazure, Théo
Published: (2026)

Computing Equilibria in Games with Stochastic Action Sets
by: Schwarz, Thomas, et al.
Published: (2026)

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

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

Automated Design of Affine Maximizer Mechanisms in Dynamic Settings
by: Curry, Michael, et al.
Published: (2024)

Algorithms for Stable Roommate with Externalities
by: Leng, Jing, et al.
Published: (2025)

Stable Matchings in Practice: A Constraint Programming Approach
by: Sun, Zhaohong, et al.
Published: (2024)

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)

Stable Marriage: Loyalty vs. Competition
by: Ronen, Amit, et al.
Published: (2025)

Empirical Validation of the Independent Chip Model
by: Kim, Juho
Published: (2025)

Improved learning rates in multi-unit uniform price auctions
by: Potfer, Marius, et al.
Published: (2025)

The Tragedy of the Commons in Multi-Population Resource Games
by: Vahmian, Yamin, et al.
Published: (2026)

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

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)