Image de couverture de livre

Non-uniformly Stable Common Independent Sets

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Kamiyama, Naoyuki
Format:	Preprint
Publié:	2026
Sujets:	Computer Science and Game Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Non-uniformly Stable Matchings
par: Kamiyama, Naoyuki
Publié: (2024)

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

The Strongly Stable Matching Problem with Closures
par: Kamiyama, Naoyuki
Publié: (2024)

Modifying an Instance of the Super-Stable Matching Problem
par: Kamiyama, Naoyuki
Publié: (2024)

The Strongly Stable Roommates Problem and Linear Programming
par: Kamiyama, Naoyuki
Publié: (2025)

A Linear Programming Approach to the Super-Stable Roommates Problem
par: Kamiyama, Naoyuki
Publié: (2025)

Reachability of Fair Allocations via Sequential Exchanges
par: Igarashi, Ayumi, et autres
Publié: (2023)

Reforming an Unfair Allocation by Exchanging Goods
par: Yuen, Sheung Man, et autres
Publié: (2024)

Two-Sided Fairness in Many-to-One Matching
par: Igarashi, Ayumi, et autres
Publié: (2025)

Fast, Fair and Truthful Distributed Stable Matching for Common Preferences
par: Hirvonen, Juho, et autres
Publié: (2024)

Obvious Independence of Clones
par: Berker, Ratip Emin, et autres
Publié: (2022)

Properties of Path-Independent Choice Correspondences and Their Applications to Efficient and Stable Matchings
par: Bando, Keisuke, et autres
Publié: (2025)

Verification with Common Knowledge of Rationality for Graph Games
par: Nakanishi, Rindo, et autres
Publié: (2024)

Subgame Optimal and Prior-Independent Online Algorithms
par: Hartline, Jason, et autres
Publié: (2024)

The Complexity of Two-Team Polymatrix Games with Independent Adversaries
par: Hollender, Alexandros, et autres
Publié: (2024)

On Robustness to $k$-wise Independence of Optimal Bayesian Mechanisms
par: Gravin, Nick, et autres
Publié: (2024)

Fast value iteration: A uniform approach to efficient algorithms for energy games
par: Cadilhac, Michaël, et autres
Publié: (2021)

Common-agency Games for Multi-Objective Test-Time Alignment
par: Chen, Baiting, et autres
Publié: (2026)

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

Settling the Competition Complexity of Additive Buyers over Independent Items
par: Derakhshan, Mahsa, et autres
Publié: (2024)

Mean-Field Games With Finitely Many Players: Independent Learning and Subjectivity
par: Yongacoglu, Bora, et autres
Publié: (2022)

Control in Stable Marriage and Stable Roommates: Complexity and Algorithms
par: Chen, Jiehua, et autres
Publié: (2025)

Common revenue allocation in DMUs with two stages based on DEA cross-efficiency and cooperative game
par: Wang, Xinyu, et autres
Publié: (2024)

The Distortion of Stable Matching
par: Filos-Ratsikas, Aris, et autres
Publié: (2026)

Stable Matching Games
par: Garrido-Lucero, Felipe, et autres
Publié: (2020)

Computing Equilibria in Games with Stochastic Action Sets
par: Schwarz, Thomas, et autres
Publié: (2026)

Algorithms for Stable Roommate with Externalities
par: Leng, Jing, et autres
Publié: (2025)

Automated Design of Affine Maximizer Mechanisms in Dynamic Settings
par: Curry, Michael, et autres
Publié: (2024)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
par: Ghosh, Abheek, et autres
Publié: (2024)

Efficient Interview Scheduling for Stable Matching
par: Babaioff, Moshe, et autres
Publié: (2026)

Capacity Modification in the Stable Matching Problem
par: Gokhale, Salil, et autres
Publié: (2024)

Stable Marriage: Loyalty vs. Competition
par: Ronen, Amit, et autres
Publié: (2025)

Independence of Approximate Clones
par: Delemazure, Théo
Publié: (2026)

Robust Stable Matchings: Dealing with Changes in Preferences
par: Gangam, Rohith Reddy, et autres
Publié: (2026)

Stable Matching under Matroid Rank Valuations
par: Eden, Alon, et autres
Publié: (2025)

Maximum Stable Matching with Matroids and Partial Orders
par: Csáji, Gergely, et autres
Publié: (2022)

Strategyproof Facility Location in Perturbation Stable Instances
par: Fotakis, Dimitris, et autres
Publié: (2021)

Core-Stable Kidney Exchange via Altruistic Donors
par: Csáji, Gergely, et autres
Publié: (2026)

Individually Stable Dynamics in Coalition Formation over Graphs
par: Fanelli, Angelo, et autres
Publié: (2024)

Near-Feasible Solutions to Complex Stable Matching Problems
par: Csáji, Gergely
Publié: (2025)