Imagen de Portada

Pandora's Box Problem With Time Constraints

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Amanatidis, Georgios, Berger, Ben, Ezra, Tomer, Feldman, Michal, Fusco, Federico, Reiffenhäuser, Rebecca, Tsikiridis, Artem
Formato:	Preprint
Publicado:	2024
Materias:	Computer Science and Game Theory Data Structures and Algorithms Probability
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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)

Algorithmically Fair Maximization of Multiple Submodular Objective Functions
por: Amanatidis, Georgios, et al.
Publicado: (2024)

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

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

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

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
por: Amanatidis, Georgios, et al.
Publicado: (2020)

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

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

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

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

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
por: Amanatidis, Georgios, et al.
Publicado: (2021)

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

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

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

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

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)

Fair Multi-agent Persuasion with Submodular Constraints
por: Bai, Yannan, et al.
Publicado: (2025)

Fair Rent Division: New Budget and Rent Constraints
por: Gangam, Rohith Reddy, et al.
Publicado: (2025)

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

Scheduling with Uncertain Holding Costs and its Application to Content Moderation
por: Gocmen, Caner, et al.
Publicado: (2025)

Combinatorial Bernoulli Factories
por: Niazadeh, Rad, et al.
Publicado: (2020)

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)

Envy Cycle Elimination with Strategic Agents: Best Responses and Fairness Guarantees
por: Amanatidis, Georgios, et al.
Publicado: (2026)

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

Polynomial-Time Approximation Schemes via Utility Alignment: Unit-Demand Pricing and More
por: Bowers, Robin, et al.
Publicado: (2025)

The Competition Complexity of Prophet Inequalities
por: Brustle, Johannes, et al.
Publicado: (2024)

Covering a Few Submodular Constraints and Applications
por: Bajpai, Tanvi, et al.
Publicado: (2025)

Public Goods Games in Directed Networks with Constraints on Sharing
por: Deligkas, Argyrios, et al.
Publicado: (2025)

Efficiency in the Roommates Problem
por: Kuwahara, Keita
Publicado: (2025)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
por: Vaze, Rahul, et al.
Publicado: (2025)