:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Garrido-Lucero, Felipe, Laraki, Rida
Format:	Preprint
Published:	2020
Subjects:	Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2008.01680
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

General Matching Games
by: Garrido-Lucero, Felipe, et al.
Published: (2025)

Polytime Algorithms for One-to-Many Matching Games
by: Garrido-Lucero, Felipe, et al.
Published: (2021)

O'Neill's Theorem for Games
by: Govindan, Srihari, et al.
Published: (2023)

BAR Nash Equilibrium and Application to Blockchain Design
by: Reynouard, Maxime, et al.
Published: (2024)

A Unified Framework for Weighted Hypergraphic Networks and Fractional Matching
by: Castera, Rémi, et al.
Published: (2026)

Stability in Online Assignment Games
by: Martinez, Emile, et al.
Published: (2025)

Two-Sided Matching with Resource-Regional Caps
by: Garrido-Lucero, Felipe, et al.
Published: (2025)

Selling Privacy in Blockchain Transactions
by: Chionas, Georgios, et al.
Published: (2025)

Prophets Inequalities with Uncertain Acceptance
by: Martinez, Emile, et al.
Published: (2026)

The Price of Opportunity Fairness in Matroid Allocation Problems
by: Castera, Rémi, et al.
Published: (2024)

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

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

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

DU-Shapley: A Shapley Value Proxy for Efficient Dataset Valuation
by: Garrido-Lucero, Felipe, et al.
Published: (2023)

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

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)

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

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)

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

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

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)

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

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

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)

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

Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games
by: Cai, Yang, et al.
Published: (2023)

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

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

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