Image de couverture de livre

On Robust Popular Matchings with Tie-Bounded Preferences and Stable Matchings with Two-Sided Ties

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	De, Koustav
Format:	Preprint
Publié:	2025
Sujets:	Computer Science and Game Theory Multiagent Systems F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Two-Sided Manipulation Games in Stable Matching Markets
par: Hosseini, Hadi, et autres
Publié: (2025)

Matching Markets with Chores
par: Garg, Jugal, et autres
Publié: (2024)

A Protocol for Trustless Verification Under Uncertainty
par: Shi, David, et autres
Publié: (2025)

Search versus Search for Collapsing Electoral Control Types
par: Carleton, Benjamin, et autres
Publié: (2022)

Anyone but Him: The Complexity of Precluding an Alternative
par: Hemaspaandra, Edith, et autres
Publié: (2005)

A Unified Framework for Weighted Hypergraphic Networks and Fractional Matching
par: Castera, Rémi, et autres
Publié: (2026)

Persuading Stable Matching
par: Shaki, Jonathan, et autres
Publié: (2025)

Dynamic Matching Bandit For Two-Sided Online Markets
par: Li, Yuantong, et autres
Publié: (2022)

FPT-Approximability of Stable Matching Problems
par: Chen, Jiehua, et autres
Publié: (2025)

Weakly-Popular and Super-Popular Matchings with Ties and Their Connection to Stable Matchings
par: Csáji, Gergely, et autres
Publié: (2023)

Strategic Voting in the Context of Stable-Matching of Teams
par: Schmerler, Leora, et autres
Publié: (2022)

Uber Stable: Formulating the Rideshare System as a Stable Matching Problem
par: Acharya, Rhea, et autres
Publié: (2024)

Voter Participation Control in Online Polls
par: De, Koustav, et autres
Publié: (2024)

Optimal Path Planning in Hostile Environments
par: Kaczmarczyk, Andrzej, et autres
Publié: (2026)

Two-sided Competing Matching Recommendation Markets With Quota and Complementary Preferences Constraints
par: Li, Yuantong, et autres
Publié: (2023)

Faster Optimal Coalition Structure Generation via Offline Coalition Selection and Graph-Based Search
par: Taguelmimt, Redha, et autres
Publié: (2024)

Matroid Bayesian Online Selection
par: DeHaan, Ian, et autres
Publié: (2024)

Constant-Factor Distortion Mechanisms for $k$-Committee Election
par: Pulyassary, Haripriya, et autres
Publié: (2025)

Optimal Capacity Modification for Many-To-One Matching Problems
par: Chen, Jiehua, et autres
Publié: (2023)

Extending Stable and Popular Matching Algorithms from Bipartite to Arbitrary Instances
par: Csáji, Gergely
Publié: (2024)

Bribery Can Get Harder in Structured Multiwinner Approval Election
par: Kusek, Bartosz, et autres
Publié: (2022)

Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency
par: Sun, Ankang, et autres
Publié: (2024)

A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
par: Li, Bo, et autres
Publié: (2024)

Scheduling with Time Dependent Utilities: Fairness and Efficiency
par: Nicosia, Gaia, et autres
Publié: (2026)

Robust Mean-Field Games with Risk Aversion and Bounded Rationality
par: Jeloka, Bhavini, et autres
Publié: (2026)

Robustness of Approval-Based Multiwinner Voting Rules
par: Faliszewski, Piotr, et autres
Publié: (2026)

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

The Surprising Effectiveness of SP Voting with Partial Preferences
par: Hosseini, Hadi, et autres
Publié: (2024)

Parameterized Complexity of Hedonic Games with Enemy-Oriented Preferences
par: Durand, Martin, et autres
Publié: (2025)

Stable Matching with Ties: Approximation Ratios and Learning
par: Lin, Shiyun, et autres
Publié: (2024)

The Complexity of Graph Exploration Games
par: Fuchs, Janosch, et autres
Publié: (2023)

Matching Multiple Experts: On the Exploitability of Multi-Agent Imitation Learning
par: Bergerault, Antoine, et autres
Publié: (2026)

Preference-CFR$\:$ Beyond Nash Equilibrium for Better Game Strategies
par: Ju, Qi, et autres
Publié: (2024)

Breaking Exponential Complexity in Games of Ordered Preference: A Tractable Reformulation
par: Lee, Dong Ho, et autres
Publié: (2026)

Separating and Collapsing Electoral Control Types
par: Carleton, Benjamin, et autres
Publié: (2022)

You Can't Always Get What You Want: Games of Ordered Preference
par: Lee, Dong Ho, et autres
Publié: (2024)

Investigating the Impact of Subgraph Social Structure Preference on the Strategic Behavior of Networked Mixed-Motive Learning Agents
par: Gao, Xinqi, et autres
Publié: (2026)

Selling Privacy in Blockchain Transactions
par: Chionas, Georgios, et autres
Publié: (2025)

Introducing The Maximum Common Bigraph Problem
par: Burns, Kyle, et autres
Publié: (2026)

Optimal Capacity Modification for Stable Matchings with Ties
par: Ranjan, Keshav, et autres
Publié: (2024)