FPT-Approximability of Stable Matching Problems
Fuente:
arXiv
Saved in:
| Main Authors: | Chen, Jiehua, Roy, Sanjukta, Simola, Sofia |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Computational Social Choice: Parameterized Complexity and Challenges
by: Chen, Jiehua, et al.
Published: (2024)
by: Chen, Jiehua, et al.
Published: (2024)
Control in Hedonic Games
by: Chen, Jiehua, et al.
Published: (2026)
by: Chen, Jiehua, et al.
Published: (2026)
Optimal Capacity Modification for Many-To-One Matching Problems
by: Chen, Jiehua, et al.
Published: (2023)
by: Chen, Jiehua, et al.
Published: (2023)
Parameterized Complexity of Hedonic Games with Enemy-Oriented Preferences
by: Durand, Martin, et al.
Published: (2025)
by: Durand, Martin, et al.
Published: (2025)
Uber Stable: Formulating the Rideshare System as a Stable Matching Problem
by: Acharya, Rhea, et al.
Published: (2024)
by: Acharya, Rhea, et al.
Published: (2024)
Cutsets and EF1 Fair Division of Graphs
by: Chen, Jiehua, et al.
Published: (2024)
by: Chen, Jiehua, et al.
Published: (2024)
Persuading Stable Matching
by: Shaki, Jonathan, et al.
Published: (2025)
by: Shaki, Jonathan, et al.
Published: (2025)
Strategic Voting in the Context of Stable-Matching of Teams
by: Schmerler, Leora, et al.
Published: (2022)
by: Schmerler, Leora, et al.
Published: (2022)
Two-Sided Manipulation Games in Stable Matching Markets
by: Hosseini, Hadi, et al.
Published: (2025)
by: Hosseini, Hadi, et al.
Published: (2025)
Approximating the Core via Iterative Coalition Sampling
by: Gemp, Ian, et al.
Published: (2024)
by: Gemp, Ian, et al.
Published: (2024)
Approximating Nash Equilibria in Normal-Form Games via Stochastic Optimization
by: Gemp, Ian, et al.
Published: (2023)
by: Gemp, Ian, et al.
Published: (2023)
Partitioned Combinatorial Optimization Games
by: Chen, Jiehua, et al.
Published: (2025)
by: Chen, Jiehua, et al.
Published: (2025)
Parameterized Algorithms for Optimal Refugee Resettlement
by: Chen, Jiehua, et al.
Published: (2024)
by: Chen, Jiehua, et al.
Published: (2024)
Leveraging Team Correlation for Approximating Equilibrium in Two-Team Zero-Sum Games
by: Liu, Naming, et al.
Published: (2024)
by: Liu, Naming, et al.
Published: (2024)
The Multi-Stage Assignment Problem: A Fairness Perspective
by: J, Vibulan, et al.
Published: (2025)
by: J, Vibulan, et al.
Published: (2025)
Truthful and Trustworthy IoT AI Agents via Immediate-Penalty Enforcement under Approximate VCG Mechanisms
by: Shao, Xun, et al.
Published: (2025)
by: Shao, Xun, et al.
Published: (2025)
Facility Location for Congesting Commuters and Generalizing the Cost-Distance Problem
by: Lianeas, Thanasis, et al.
Published: (2025)
by: Lianeas, Thanasis, et al.
Published: (2025)
On Robust Popular Matchings with Tie-Bounded Preferences and Stable Matchings with Two-Sided Ties
by: De, Koustav
Published: (2025)
by: De, Koustav
Published: (2025)
Fairness Driven Slot Allocation Problem in Billboard Advertisement
by: Ali, Dildar, et al.
Published: (2025)
by: Ali, Dildar, et al.
Published: (2025)
Evolution of fairness in hybrid populations with specialised AI agents
by: Song, Zhao, et al.
Published: (2026)
by: Song, Zhao, et al.
Published: (2026)
Exploration enhances cooperation in the multi-agent communication system
by: Song, Zhao, et al.
Published: (2026)
by: Song, Zhao, et al.
Published: (2026)
Urban Emergency Rescue Based on Multi-Agent Collaborative Learning: Coordination Between Fire Engines and Traffic Lights
by: Chen, Weichao, et al.
Published: (2025)
by: Chen, Weichao, et al.
Published: (2025)
Approximate Proportionality in Online Fair Division
by: Choo, Davin, et al.
Published: (2025)
by: Choo, Davin, et al.
Published: (2025)
Approximate State Abstraction for Markov Games
by: Ishibashi, Hiroki, et al.
Published: (2024)
by: Ishibashi, Hiroki, et al.
Published: (2024)
Game-Theoretic Lens on LLM-based Multi-Agent Systems
by: Hao, Jianing, et al.
Published: (2026)
by: Hao, Jianing, et al.
Published: (2026)
Dynamic Matching Bandit For Two-Sided Online Markets
by: Li, Yuantong, et al.
Published: (2022)
by: Li, Yuantong, et al.
Published: (2022)
Approximate Feedback Nash Equilibria with Sparse Inter-Agent Dependencies
by: Liu, Xinjie, et al.
Published: (2024)
by: Liu, Xinjie, et al.
Published: (2024)
Matching Multiple Experts: On the Exploitability of Multi-Agent Imitation Learning
by: Bergerault, Antoine, et al.
Published: (2026)
by: Bergerault, Antoine, et al.
Published: (2026)
Scalable Neural Incentive Design with Parameterized Mean-Field Approximation
by: Corecco, Nathan, et al.
Published: (2025)
by: Corecco, Nathan, et al.
Published: (2025)
Strategically Robust Multi-Agent Reinforcement Learning with Linear Function Approximation
by: Gonzales, Jake, et al.
Published: (2026)
by: Gonzales, Jake, et al.
Published: (2026)
Two-sided Competing Matching Recommendation Markets With Quota and Complementary Preferences Constraints
by: Li, Yuantong, et al.
Published: (2023)
by: Li, Yuantong, et al.
Published: (2023)
Constant-Memory Strategies in Stochastic Games: Best Responses and Equilibria
by: Zhu, Fengming, et al.
Published: (2025)
by: Zhu, Fengming, et al.
Published: (2025)
On Condorcet's Jury Theorem with Abstention
by: Meir, Reshef, et al.
Published: (2025)
by: Meir, Reshef, et al.
Published: (2025)
Optimal Strategy Revision in Population Games: A Mean Field Game Theory Perspective
by: Barreiro-Gomez, Julian, et al.
Published: (2025)
by: Barreiro-Gomez, Julian, et al.
Published: (2025)
MAPPO-LCR: Multi-Agent Proximal Policy Optimization with Local Cooperation Reward in Spatial Public Goods Games
by: Yang, Zhaoqilin, et al.
Published: (2025)
by: Yang, Zhaoqilin, et al.
Published: (2025)
Smooth Games of Configuration in the Linear-Quadratic Setting
by: Milzman, Jesse, et al.
Published: (2025)
by: Milzman, Jesse, et al.
Published: (2025)
Nash Q-Network for Multi-Agent Cybersecurity Simulation
by: Xie, Qintong, et al.
Published: (2025)
by: Xie, Qintong, et al.
Published: (2025)
Distribution through Repeated Market with Buying Rights
by: Sychrovský, David, et al.
Published: (2025)
by: Sychrovský, David, et al.
Published: (2025)
Identifying Imperfect Clones in Elections
by: Faliszewski, Piotr, et al.
Published: (2025)
by: Faliszewski, Piotr, et al.
Published: (2025)
Equilibria in routing games with connected autonomous vehicles will not be strong, as exclusive clubs may form
by: Kucharski, Rafał, et al.
Published: (2025)
by: Kucharski, Rafał, et al.
Published: (2025)
Similar Items
-
Computational Social Choice: Parameterized Complexity and Challenges
by: Chen, Jiehua, et al.
Published: (2024) -
Control in Hedonic Games
by: Chen, Jiehua, et al.
Published: (2026) -
Optimal Capacity Modification for Many-To-One Matching Problems
by: Chen, Jiehua, et al.
Published: (2023) -
Parameterized Complexity of Hedonic Games with Enemy-Oriented Preferences
by: Durand, Martin, et al.
Published: (2025) -
Uber Stable: Formulating the Rideshare System as a Stable Matching Problem
by: Acharya, Rhea, et al.
Published: (2024)