Cover Image

Pandora with Inaccurate Priors

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Banihashem, Kiarash, Chen, Xiang, Hajiaghayi, MohammadTaghi, Kim, Sungchul, Mahadik, Kanak, Rossi, Ryan, Yu, Tong
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Matroid Algorithms Under Size-Sensitive Independence Oracles
by: Banihashem, Kiarash, et al.
Published: (2026)

Dynamic Metric Embedding into $\ell_p$ Space
by: Banihashem, Kiarash, et al.
Published: (2024)

A Dynamic Algorithm for Weighted Submodular Cover Problem
by: Banihashem, Kiarash, et al.
Published: (2024)

Bandit Social Learning: Exploration under Myopic Behavior
by: Banihashem, Kiarash, et al.
Published: (2023)

Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond
by: Banihashem, Kiarash, et al.
Published: (2025)

Replicable Composition
by: Banihashem, Kiarash, et al.
Published: (2026)

Beating Competitive Ratio 4 for Graphic Matroid Secretary
by: Banihashem, Kiarash, et al.
Published: (2025)

Active Learning for Decision Trees with Provable Guarantees
by: Moakhar, Arshia Soltani, et al.
Published: (2026)

Adversarially Robust Approximate Furthest Neighbor
by: Banihashem, Kiarash, et al.
Published: (2026)

Bi-Criteria Metric Distortion
by: Banihashem, Kiarash, et al.
Published: (2024)

Breaking a Long-Standing Barrier: 2-$\varepsilon$ Approximation for Steiner Forest
by: Ahmadi, Ali, et al.
Published: (2025)

Prize-Collecting Forest with Submodular Penalties: Improved Approximation
by: Ahmadi, Ali, et al.
Published: (2025)

2-Approximation for Prize-Collecting Steiner Forest
by: Ahmadi, Ali, et al.
Published: (2023)

Prize-Collecting Steiner Tree: A 1.79 Approximation
by: Ahmadi, Ali, et al.
Published: (2024)

Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
by: Das, Debarati, et al.
Published: (2025)

Replication-proof Bandit Mechanism Design with Bayesian Agents
by: Shin, Suho, et al.
Published: (2023)

Optimal Contest Beyond Convexity
by: Golrezaei, Negin, et al.
Published: (2026)

Fairness and Efficiency in Online Class Matching
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2024)

The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends
by: Blank, Lotte, et al.
Published: (2025)

Online Sampling and Decision Making with Low Entropy
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2021)

Optimal Algorithms for Free Order Multiple-Choice Secretary
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2022)

Optimal 4-Approximation for the Correlated Pandora's Problem
by: Bansal, Nikhil, et al.
Published: (2025)

Algorithmic Delegated Choice: An Annotated Reading List
by: Hajiaghayi, Mohammad T., et al.
Published: (2025)

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

Delegation with Costly Inspection
by: Hajiaghayi, Mohammad T., et al.
Published: (2025)

Nearly-Optimal Consensus Tolerating Adaptive Omissions: Why is a Lot of Randomness Needed?
by: Hajiaghayi, Mohammad T., et al.
Published: (2024)

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

Optimal Stopping with a Predicted Prior
by: Bai, Tian, et al.
Published: (2025)

Limitations of Stochastic Selection with Pairwise Independent Priors
by: Dughmi, Shaddin, et al.
Published: (2023)

A Simple Analysis of Ranking in General Graphs
by: Derakhshan, Mahsa, et al.
Published: (2025)

Improved Approximation for Ranking on General Graphs
by: Derakhshan, Mahsa, et al.
Published: (2025)

Towards Optimal Multi-draft Speculative Decoding
by: Hu, Zhengmian, et al.
Published: (2025)

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

Bubble-Flip -- A New Generation Algorithm for Prefix Normal Words
by: Cicalese, Ferdinando, et al.
Published: (2017)

Decision Tree Learning on Product Spaces
by: Moakahr, Arshia Soltani, et al.
Published: (2026)

Pattern Discovery in Colored Strings
by: Lipták, Zsuzsanna, et al.
Published: (2020)

Exact Clique Number Manipulation via Edge Interdiction
by: Zhou, Yi, et al.
Published: (2026)

The self-concordant perceptron is efficient on a sub-family feasibility instances
by: Chan-Hon-Tong, Adrien
Published: (2019)

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

A simple and efficient preprocessing step for convex hull problem
by: Heydari, Mohammad, et al.
Published: (2023)