Imagen de Portada

Pandora's Problem with Combinatorial Cost

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Berger, Ben, Ezra, Tomer, Feldman, Michal, Fusco, Federico
Formato:	Preprint
Publicado:	2023
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

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

Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms
por: Ezra, Tomer, et al.
Publicado: (2024)

Pandora's Box Problem with Order Constraints
por: Boodaghians, Shant, et al.
Publicado: (2020)

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

Online Combinatorial Allocation with Interdependent Values
por: Feldman, Michal, et al.
Publicado: (2025)

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

Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids
por: Eden, Alon, et al.
Publicado: (2024)

Efficient Two-Sided Markets with Limited Information
por: Dütting, Paul, et al.
Publicado: (2020)

Combinatorial Stationary Prophet Inequalities
por: Patel, Neel, et al.
Publicado: (2023)

An $α$-regret analysis of Adversarial Bilateral Trade
por: Azar, Yossi, et al.
Publicado: (2022)

Multi-Unit Combinatorial Prophet Inequalities
por: Chawla, Shuchi, et al.
Publicado: (2025)

Single-Sample Prophet Inequalities via Greedy-Ordered Selection
por: Caramanis, Constantine, et al.
Publicado: (2021)

Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
por: Liu, Junyan, et al.
Publicado: (2025)

Prophet Inequalities with Cancellation Costs
por: Ekbatani, Farbod, et al.
Publicado: (2024)

Repeated Bilateral Trade Against a Smoothed Adversary
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)

Threshold Policies with Tight Guarantees for Online Selection with Convex Costs
por: Tan, Xiaoqi, et al.
Publicado: (2023)

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

The Secretary Problem with Predicted Additive Gap
por: Braun, Alexander, et al.
Publicado: (2024)

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)

Online Block Packing
por: Eliezer, Ariel Ben, 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)

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

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

Designing Automated Market Makers for Combinatorial Securities: A Geometric Viewpoint
por: Hossain, Prommy Sultana, et al.
Publicado: (2024)

Online Combinatorial Allocations and Auctions with Few Samples
por: Dütting, Paul, et al.
Publicado: (2024)

Combinatorial Pen Testing (or Consumer Surplus of Deferred-Acceptance Auctions)
por: Ganesh, Aadityan, et al.
Publicado: (2023)

Delegation with Costly Inspection
por: Hajiaghayi, Mohammad T., et al.
Publicado: (2025)

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

Group Fair Matchings using Convex Cost Functions
por: Panda, Atasi, et al.
Publicado: (2025)

Threshold Testing and Semi-Online Prophet Inequalities
por: Hoefer, Martin, et al.
Publicado: (2023)

How to Make Knockout Tournaments More Popular?
por: Chaudhary, Juhi, et al.
Publicado: (2023)

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

Beyond the worst case: Distortion in impartial culture electorates
por: Caragiannis, Ioannis, et al.
Publicado: (2023)

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

Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
por: Kawase, Yasushi, et al.
Publicado: (2023)

Online Coalition Formation under Random Arrival or Coalition Dissolution
por: Bullinger, Martin, et al.
Publicado: (2023)