:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Babaioff, Moshe, Gil, Rotem, Romm, Assaf
Format:	Preprint
Publié:	2026
Sujets:	Computer Science and Game Theory
Accès en ligne:	https://arxiv.org/abs/2602.20358
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Best-of-Both-Worlds Fairness via Sum-of-Variances Minimization
par: Babaioff, Moshe, et autres
Publié: (2026)

Near-Optimal Best-of-Both-Worlds Fairness for Few Agents
par: Babaioff, Moshe, et autres
Publié: (2026)

On the Welfare of EIP-1559 with Patient Bidders
par: Babaioff, Moshe, et autres
Publié: (2025)

Approximating Gains-from-Trade in Matching Markets
par: Babaioff, Moshe, et autres
Publié: (2026)

Share-Based Fairness for Arbitrary Entitlements
par: Babaioff, Moshe, et autres
Publié: (2024)

Pareto-Efficient Multi-Buyer Mechanisms: Characterization, Fairness and Welfare
par: Babaioff, Moshe, et autres
Publié: (2026)

Strengthening Bulow-Klemperer-Style Results for Multi-Unit Auctions
par: Babaioff, Moshe, et autres
Publié: (2026)

Truthful-in-Expectation Mechanisms for MMS Approximation
par: Babaioff, Moshe, et autres
Publié: (2026)

On the Efficiency of Fair and Truthful Trade Mechanisms
par: Babaioff, Moshe, et autres
Publié: (2025)

Bundling in Oligopoly: Revenue Maximization with Single-Item Competitors
par: Babaioff, Moshe, et autres
Publié: (2024)

On Truthful Mechanisms without Pareto-efficiency: Characterizations and Fairness
par: Babaioff, Moshe, et autres
Publié: (2024)

Stable Matching with Interviews
par: Ashlagi, Itai, et autres
Publié: (2025)

Distributed Interview Selection for Stable Matching in Large Random Markets
par: Cole, Richard, et autres
Publié: (2025)

Learning to Maximize Gains From Trade in Small Markets
par: Babaioff, Moshe, et autres
Publié: (2024)

The Distortion of Stable Matching
par: Filos-Ratsikas, Aris, et autres
Publié: (2026)

Stable Matching Games
par: Garrido-Lucero, Felipe, et autres
Publié: (2020)

Non-uniformly Stable Matchings
par: Kamiyama, Naoyuki
Publié: (2024)

Finding Possible Winners in Spatial Voting with Incomplete Information
par: Shachnai, Hadas, 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)

Capacity Modification in the Stable Matching Problem
par: Gokhale, Salil, et autres
Publié: (2024)

The Strongly Stable Matching Problem with Closures
par: Kamiyama, Naoyuki
Publié: (2024)

Dynamic Rental Games with Stagewise Individual Rationality
par: Berzack, Batya, et autres
Publié: (2025)

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

Robust Stable Matchings: Dealing with Changes in Preferences
par: Gangam, Rohith Reddy, et autres
Publié: (2026)

Stable Matching under Matroid Rank Valuations
par: Eden, Alon, et autres
Publié: (2025)

Maximum Stable Matching with Matroids and Partial Orders
par: Csáji, Gergely, et autres
Publié: (2022)

Modifying an Instance of the Super-Stable Matching Problem
par: Kamiyama, Naoyuki
Publié: (2024)

On the Power of Strategic Corpus Enrichment in Content Creation Games
par: Nachimovsky, Haya, et autres
Publié: (2024)

Near-Feasible Solutions to Complex Stable Matching Problems
par: Csáji, Gergely
Publié: (2025)

Robustness of Stable Matchings When Attributes and Salience Determine Preferences
par: Ronen, Amit, et autres
Publié: (2026)

Maximally Diverse Stable Matchings: Optimizing Arbitrary Institutional Objectives
par: Csáji, Gergely, et autres
Publié: (2026)

Modeling Concurrent Multi-Agent Systems
par: Rajasekaran, Senthil, et autres
Publié: (2026)

Fast, Fair and Truthful Distributed Stable Matching for Common Preferences
par: Hirvonen, Juho, et autres
Publié: (2024)

Properties of Path-Independent Choice Correspondences and Their Applications to Efficient and Stable Matchings
par: Bando, Keisuke, et autres
Publié: (2025)

Fragile Stable Matchings
par: Rudov, Kirill
Publié: (2024)

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

Worst- and Average-Case Robustness of Stable Matchings: (Counting) Complexity and Experiments
par: Boehmer, Kimon, et autres
Publié: (2024)

When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners
par: Geffner, Ivan, et autres
Publié: (2025)

Sponsored Question Answering
par: Mordo, Tommy, et autres
Publié: (2024)

Reputation-based Persuasion Platforms
par: Arieli, Itai, et autres
Publié: (2023)