Imagen de Portada

Stable Matching Games

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Garrido-Lucero, Felipe, Laraki, Rida
Formato:	Preprint
Publicado:	2020
Materias:	Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

General Matching Games
por: Garrido-Lucero, Felipe, et al.
Publicado: (2025)

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

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

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

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

Stability in Online Assignment Games
por: Martinez, Emile, et al.
Publicado: (2025)

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

Selling Privacy in Blockchain Transactions
por: Chionas, Georgios, et al.
Publicado: (2025)

Prophets Inequalities with Uncertain Acceptance
por: Martinez, Emile, et al.
Publicado: (2026)

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

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

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

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

Non-uniformly Stable Matchings
por: Kamiyama, Naoyuki
Publicado: (2024)

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

The Strongly Stable Matching Problem with Closures
por: Kamiyama, Naoyuki
Publicado: (2024)

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

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

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

Stable Matching under Matroid Rank Valuations
por: Eden, Alon, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

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

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

Fragile Stable Matchings
por: Rudov, Kirill
Publicado: (2024)

Persuading Stable Matching
por: Shaki, Jonathan, et al.
Publicado: (2025)

Stable Matching with Contingent Priorities
por: Rios, Ignacio, et al.
Publicado: (2024)

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

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

Stable Matching with Interviews
por: Ashlagi, Itai, et al.
Publicado: (2025)

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

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

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

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