Imagen de Portada

The Secretary Problem with Predicted Additive Gap

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Braun, Alexander, Sarkar, Sherry
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Additively Competitive Secretaries
por: Mahdian, Mohammad, et al.
Publicado: (2026)

Beyond matroids: Secretary Problem and Prophet Inequality with general constraints
por: Rubinstein, Aviad
Publicado: (2016)

Prophet and Secretary at the Same Time
por: Kehne, Gregory, et al.
Publicado: (2025)

Prophet Secretary and Matching: the Significance of the Largest Item
por: Chen, Ziyun, et al.
Publicado: (2024)

Laminar Matroid Secretary: Greedy Strikes Back
por: Huang, Zhiyi, et al.
Publicado: (2023)

Secretary, Prophet, and Stochastic Probing via Big-Decisions-First
por: Rubinstein, Aviad, et al.
Publicado: (2026)

Computing Approximately Proportional Allocations of Indivisible Goods: Beyond Additive and Monotone Valuations
por: Andersen, Martin Jupakkal, et al.
Publicado: (2025)

Welfare Approximation in Additively Separable Hedonic Games
por: Bullinger, Martin, et al.
Publicado: (2025)

The Secretary Problem with Predictions and a Chosen Order
por: Karisani, Helia, et al.
Publicado: (2026)

A Note on Approximating Weighted Nash Social Welfare with Additive Valuations
por: Feng, Yuda, et al.
Publicado: (2024)

Single-Deviation Stability in Additively Separable Hedonic Games with Constrained Coalition Sizes
por: Bullinger, Martin, et al.
Publicado: (2025)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
por: Bei, Xiaohui, et al.
Publicado: (2025)

The Average-Value Allocation Problem
por: Bhawalkar, Kshipra, et al.
Publicado: (2024)

Pandora's Problem with Combinatorial Cost
por: Berger, Ben, et al.
Publicado: (2023)

Canadian Traveller Problems in Temporal Graphs
por: Bellitto, Thomas, et al.
Publicado: (2024)

The Min Max Average Cycle Weight Problem
por: Elmalem, Noga Klein, et al.
Publicado: (2025)

Static Pricing for Online Selection Problem and its Variants
por: Sun, Bo, et al.
Publicado: (2024)

Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
por: Glitzner, Frederik, et al.
Publicado: (2024)

Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
por: Segev, Danny, et al.
Publicado: (2020)

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
por: Constantinescu, Andrei, et al.
Publicado: (2023)

Strategic Facility Location via Predictions
por: Chen, Qingyun, et al.
Publicado: (2024)

Online Nash Welfare Maximization Without Predictions
por: Huang, Zhiyi, et al.
Publicado: (2022)

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

Core Stability in Additively Separable Hedonic Games of Low Treewidth
por: Hanaka, Tesshu, et al.
Publicado: (2024)

Pandora's Box Problem With Time Constraints
por: Amanatidis, Georgios, et al.
Publicado: (2024)

Bridging the Gap Between Stable Marriage and Stable Roommates: A Parameterized Algorithm for Optimal Stable Matchings
por: Cheng, Christine T., et al.
Publicado: (2026)

On the Correlation Gap of Matroids
por: Husić, Edin, et al.
Publicado: (2022)

Hedonic Seat Arrangement Problems
por: Bodlaender, Hans L., et al.
Publicado: (2020)

Matching with Nested and Bundled Pandora Boxes
por: Bowers, Robin, et al.
Publicado: (2024)

Data Exchange Markets via Utility Balancing
por: Bhaskara, Aditya, et al.
Publicado: (2024)

Budget-feasible Egalitarian Allocation of Conflicting Jobs
por: Gupta, Sushmita, et al.
Publicado: (2024)

Randomized Binary and Tree Search under Pressure
por: Caracci, Agustín, et al.
Publicado: (2024)

A Little Aggression Goes a Long Way
por: Krishnan, Jyothi, et al.
Publicado: (2024)

Online Matroid Embeddings
por: Cristi, Andrés, et al.
Publicado: (2024)

Optimal Stopping with Interdependent Values
por: Mauras, Simon, et al.
Publicado: (2024)

When far is better: The Chamberlin-Courant approach to obnoxious committee selection
por: Gupta, Sushmita, et al.
Publicado: (2024)

Setting Targets is All You Need:Improved Order Competitive Ratio for Online Selection
por: Chen, Liyan, et al.
Publicado: (2024)

Metric Distortion of Line-up Elections: The Right Person for the Right Job
por: Jerrett, Christopher, et al.
Publicado: (2024)

Designing Exploration Contracts
por: Hoefer, Martin, et al.
Publicado: (2024)

Group Fairness and Multi-criteria Optimization in School Assignment
por: A., Santhini K., et al.
Publicado: (2024)