Cover Image

Stable Matching with Ties: Approximation Ratios and Learning

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lin, Shiyun, Mauras, Simon, Merlis, Nadav, Perchet, Vianney
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Adaptive Bandit Algorithms for Contextual Matching Markets
by: Lin, Shiyun, et al.
Published: (2026)

Improved Algorithms for Contextual Dynamic Pricing
by: Tullii, Matilde, et al.
Published: (2024)

Comparing Uniform Price and Discriminatory Multi-Unit Auctions through Regret Minimization
by: Potfer, Marius, et al.
Published: (2025)

A survey on multi-player bandits
by: Boursier, Etienne, et al.
Published: (2022)

Strategic Multi-Armed Bandit Problems Under Debt-Free Reporting
by: Yahmed, Ahmed Ben, et al.
Published: (2025)

Learning to Allocate Resources with Censored Feedback
by: Montanari, Giovanni, et al.
Published: (2026)

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

Improved learning rates in multi-unit uniform price auctions
by: Potfer, Marius, et al.
Published: (2025)

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

Calibrated Forecasting and Persuasion
by: Jain, Atulya, et al.
Published: (2024)

The Value of Reward Lookahead in Reinforcement Learning
by: Merlis, Nadav, et al.
Published: (2024)

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

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

Bandit Learning in Housing Markets
by: Lin, Shiyun
Published: (2025)

Feature-Based Online Bilateral Trade
by: Gaucher, Solenne, et al.
Published: (2024)

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

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

A Direct Proof of the Short-Side Advantage in Random Matching Markets
by: Mauras, Simon, et al.
Published: (2025)

Refined Sample Complexity for Markov Games with Independent Linear Function Approximation
by: Dai, Yan, et al.
Published: (2024)

On Optimal Tradeoffs between EFX and Nash Welfare
by: Feldman, Michal, et al.
Published: (2023)

Bandit Learning in Matching Markets: Utilitarian and Rawlsian Perspectives
by: Hosseini, Hadi, et al.
Published: (2024)

Addressing Bias in Online Selection with Limited Budget of Comparisons
by: Benomar, Ziyad, et al.
Published: (2023)

Approximating Nash Equilibria in General-Sum Games via Meta-Learning
by: Sychrovský, David, et al.
Published: (2025)

Optimal Capacity Modification for Stable Matchings with Ties
by: Ranjan, Keshav, et al.
Published: (2024)

Persuading a Behavioral Agent: Approximately Best Responding and Learning
by: Chen, Yiling, et al.
Published: (2023)

Learning-Augmented Online Bidding in Stochastic Settings
by: Angelopoulos, Spyros, et al.
Published: (2025)

Decentralized and Privacy-Preserving Learning of Approximate Stackelberg Solutions in Energy Trading Games with Demand Response Aggregators
by: Kampezidou, Styliani I., et al.
Published: (2023)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
by: Zhang, Brian Hu, et al.
Published: (2025)

Truthful Matching with Online Items and Offline Agents
by: Feldman, Michal, et al.
Published: (2022)

Hedging and Approximate Truthfulness in Traditional Forecasting Competitions
by: Monroe, Mary, et al.
Published: (2024)

Pricing Query Complexity of Multiplicative Revenue Approximation
by: Tang, Wei, et al.
Published: (2026)

Approximating the Shapley Value without Marginal Contributions
by: Kolpaczki, Patrick, et al.
Published: (2023)

Shapley Value Approximation Based on k-Additive Games
by: Pelegrina, Guilherme Dean, et al.
Published: (2025)

Improved Bandits in Many-to-one Matching Markets with Incentive Compatibility
by: Kong, Fang, et al.
Published: (2024)

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

Principal-Agent Problem with Third Party: Information Design from Social Planner's Perspective
by: Lin, Shiyun, et al.
Published: (2023)

Smoothed Elicitation Complexity for Approximate $Γ$-calibration of Discrete Classification Tasks
by: Finocchiaro, Jessica, et al.
Published: (2026)

Prophet Inequalities: Competing with the Top $\ell$ Items is Easy
by: Molina, Mathieu, et al.
Published: (2024)

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

Fundamental Limits of Game-Theoretic LLM Alignment: Smith Consistency and Preference Matching
by: Shi, Zhekun, et al.
Published: (2025)