:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Babaioff, Moshe, Gil, Rotem, Romm, Assaf
Formato:	Preprint
Publicado:	2026
Materias:	Computer Science and Game Theory
Acceso en línea:	https://arxiv.org/abs/2602.20358
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On Best-of-Both-Worlds Fairness via Sum-of-Variances Minimization
por: Babaioff, Moshe, et al.
Publicado: (2026)

Near-Optimal Best-of-Both-Worlds Fairness for Few Agents
por: Babaioff, Moshe, et al.
Publicado: (2026)

On the Welfare of EIP-1559 with Patient Bidders
por: Babaioff, Moshe, et al.
Publicado: (2025)

Approximating Gains-from-Trade in Matching Markets
por: Babaioff, Moshe, et al.
Publicado: (2026)

Share-Based Fairness for Arbitrary Entitlements
por: Babaioff, Moshe, et al.
Publicado: (2024)

Pareto-Efficient Multi-Buyer Mechanisms: Characterization, Fairness and Welfare
por: Babaioff, Moshe, et al.
Publicado: (2026)

Strengthening Bulow-Klemperer-Style Results for Multi-Unit Auctions
por: Babaioff, Moshe, et al.
Publicado: (2026)

Truthful-in-Expectation Mechanisms for MMS Approximation
por: Babaioff, Moshe, et al.
Publicado: (2026)

On the Efficiency of Fair and Truthful Trade Mechanisms
por: Babaioff, Moshe, et al.
Publicado: (2025)

Bundling in Oligopoly: Revenue Maximization with Single-Item Competitors
por: Babaioff, Moshe, et al.
Publicado: (2024)

On Truthful Mechanisms without Pareto-efficiency: Characterizations and Fairness
por: Babaioff, Moshe, et al.
Publicado: (2024)

Stable Matching with Interviews
por: Ashlagi, Itai, et al.
Publicado: (2025)

Distributed Interview Selection for Stable Matching in Large Random Markets
por: Cole, Richard, et al.
Publicado: (2025)

Learning to Maximize Gains From Trade in Small Markets
por: Babaioff, Moshe, et al.
Publicado: (2024)

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

Stable Matching Games
por: Garrido-Lucero, Felipe, et al.
Publicado: (2020)

Non-uniformly Stable Matchings
por: Kamiyama, Naoyuki
Publicado: (2024)

Finding Possible Winners in Spatial Voting with Incomplete Information
por: Shachnai, Hadas, et al.
Publicado: (2025)

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

Capacity Modification in the Stable Matching Problem
por: Gokhale, Salil, et al.
Publicado: (2024)

The Strongly Stable Matching Problem with Closures
por: Kamiyama, Naoyuki
Publicado: (2024)

Dynamic Rental Games with Stagewise Individual Rationality
por: Berzack, Batya, et al.
Publicado: (2025)

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

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

Stable Matching under Matroid Rank Valuations
por: Eden, Alon, et al.
Publicado: (2025)

Maximum Stable Matching with Matroids and Partial Orders
por: Csáji, Gergely, et al.
Publicado: (2022)

Modifying an Instance of the Super-Stable Matching Problem
por: Kamiyama, Naoyuki
Publicado: (2024)

On the Power of Strategic Corpus Enrichment in Content Creation Games
por: Nachimovsky, Haya, et al.
Publicado: (2024)

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

Robustness of Stable Matchings When Attributes and Salience Determine Preferences
por: Ronen, Amit, et al.
Publicado: (2026)

Maximally Diverse Stable Matchings: Optimizing Arbitrary Institutional Objectives
por: Csáji, Gergely, et al.
Publicado: (2026)

Modeling Concurrent Multi-Agent Systems
por: Rajasekaran, Senthil, et al.
Publicado: (2026)

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

Properties of Path-Independent Choice Correspondences and Their Applications to Efficient and Stable Matchings
por: Bando, Keisuke, et al.
Publicado: (2025)

Fragile Stable Matchings
por: Rudov, Kirill
Publicado: (2024)

Persuading Stable Matching
por: Shaki, Jonathan, et al.
Publicado: (2025)

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

When Competition Helps: Achieving Optimal Traffic Flow with Multiple Autonomous Planners
por: Geffner, Ivan, et al.
Publicado: (2025)

Sponsored Question Answering
por: Mordo, Tommy, et al.
Publicado: (2024)

Reputation-based Persuasion Platforms
por: Arieli, Itai, et al.
Publicado: (2023)