:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Ronen, Amit, Ravi, S. S., Kraus, Sarit
Format:	Preprint
Published:	2026
Subjects:	Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2602.04115
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Persuading Stable Matching
by: Shaki, Jonathan, et al.
Published: (2025)

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

Facilitating Matches on Allocation Platforms
by: Trabelsi, Yohai, et al.
Published: (2025)

Robust Solutions for Multi-Defender Stackelberg Security Games
by: Mutzari, Dolev, et al.
Published: (2022)

Bribery for Coalitions in Parliamentary Elections
by: Barr, Hodaya, et al.
Published: (2025)

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

Bayesian Persuasion with Externalities: Exploiting Agent Types
by: Shaki, Jonathan, et al.
Published: (2024)

Voter Priming Campaigns: Strategies, Equilibria, and Algorithms
by: Shaki, Jonathan, et al.
Published: (2024)

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

Coalition Tactics: Bribery and Control in Parliamentary Elections
by: Barr, Hodaya, et al.
Published: (2026)

Control for Coalitions in Parliamentary Elections
by: Barr, Hodaya, et al.
Published: (2025)

Intelligent Agents for Auction-based Federated Learning: A Survey
by: Tang, Xiaoli, et al.
Published: (2024)

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

Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences
by: McCauley, Samuel, et al.
Published: (2026)

The Complexity of Manipulation of k-Coalitional Games on Graphs
by: Barr, Hodaya, et al.
Published: (2024)

Sustaining Cooperation in Populations Guided by AI: A Folk Theorem for LLMs
by: Shaki, Jonathan, et al.
Published: (2026)

Matching with Committee Preferences
by: Song, Haoyu, et al.
Published: (2026)

Tacit Coordination of Large Language Models
by: Aharon, Ido, et al.
Published: (2026)

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

Learning Optimal Stable Matches in Decentralized Markets with Unknown Preferences
by: Shah, Vade, et al.
Published: (2024)

On Robust Popular Matchings with Tie-Bounded Preferences and Stable Matchings with Two-Sided Ties
by: De, Koustav
Published: (2025)

Aggregation of Antagonistic Contingent Preferences: When Is It Possible?
by: Deng, Xiaotie, et al.
Published: (2024)

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

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

Popular and Dominant Matchings with Uncertain, Multilayer and Aggregated Preferences
by: Csáji, Gergely
Published: (2023)

Non-uniformly Stable Matchings
by: Kamiyama, Naoyuki
Published: (2024)

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

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)

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

Two-Stage Stochastic Capacity Expansion in Stable Matching under Truthful or Strategic Preference Uncertainty
by: Bazotte, Maria, et al.
Published: (2025)

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)

When Graph Traversal Meets Structured Preferences: Unified Framework and Complexity Results
by: Rong, Guozhen, et al.
Published: (2026)

On the Convergence of Federated Learning Algorithms without Data Similarity
by: Beikmohammadi, Ali, et al.
Published: (2024)

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

Competitive Search with a Faulty Satnav (GPS): When Probability Matching is Rational
by: Alpern, Steve, et al.
Published: (2026)

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