Image de couverture de livre

Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Ezra, Tomer, Feldman, Michal, Tang, Zhihao Gavin
Format:	Preprint
Publié:	2024
Sujets:	Computer Science and Game Theory Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Pandora's Problem with Combinatorial Cost
par: Berger, Ben, et autres
Publié: (2023)

Optimal Competitive Ratio of Two-sided Online Bipartite Matching
par: Tang, Zhihao Gavin
Publié: (2026)

Revisiting Ranking for Online Bipartite Matching with Random Arrivals: the Primal-Dual Analysis
par: Peng, Bo, et autres
Publié: (2025)

Setting Targets is All You Need:Improved Order Competitive Ratio for Online Selection
par: Chen, Liyan, et autres
Publié: (2024)

Pandora's Box Problem With Time Constraints
par: Amanatidis, Georgios, et autres
Publié: (2024)

Online Combinatorial Allocation with Interdependent Values
par: Feldman, Michal, et autres
Publié: (2025)

Private Interdependent Valuations: New Bounds for Single-Item Auctions and Matroids
par: Eden, Alon, et autres
Publié: (2024)

Optimal Pricing with Unreliable Signals
par: Tang, Zhihao Gavin, et autres
Publié: (2026)

Truthful Matching with Online Items and Offline Agents
par: Feldman, Michal, et autres
Publié: (2022)

Prophet Secretary and Matching: the Significance of the Largest Item
par: Chen, Ziyun, et autres
Publié: (2024)

Threshold Policies with Tight Guarantees for Online Selection with Convex Costs
par: Tan, Xiaoqi, et autres
Publié: (2023)

Prophet Upper Bounds for Online Matching and Auctions
par: Soto, José, et autres
Publié: (2024)

Risk-Sensitive Online Selection with Bounded Adaptivity
par: Nekouyan, Hossein, et autres
Publié: (2025)

Online Algorithm for Fractional Matchings with Edge Arrivals in Graphs of Maximum Degree Three
par: Pashkovich, Kanstantsin, et autres
Publié: (2026)

Weighted Envy Freeness With Bounded Subsidies
par: Elmalem, Noga Klein, et autres
Publié: (2024)

Online Matroid Embeddings
par: Cristi, Andrés, et autres
Publié: (2024)

Online Job Assignment
par: Ekbatani, Farbod, et autres
Publié: (2025)

Online Block Packing
par: Eliezer, Ariel Ben, et autres
Publié: (2025)

Stochastic Online Correlated Selection
par: Chen, Ziyun, et autres
Publié: (2024)

Online Resource Allocation with Cancellations
par: Ekbatani, Farbod, et autres
Publié: (2022)

Stability in Online Coalition Formation
par: Bullinger, Martin, et autres
Publié: (2023)

Fairness and Efficiency in Online Class Matching
par: Hajiaghayi, MohammadTaghi, et autres
Publié: (2024)

Edge-Weighted Online Bipartite Matching
par: Fahrbach, Matthew, et autres
Publié: (2020)

Algorithmic Persuasion with Evidence
par: Hoefer, Martin, et autres
Publié: (2020)

Online Matching Meets Sampling Without Replacement
par: Huang, Zhiyi, et autres
Publié: (2024)

Universal Online Contention Resolution with Preselected Order
par: Zhao, Junyao
Publié: (2025)

Threshold Testing and Semi-Online Prophet Inequalities
par: Hoefer, Martin, et autres
Publié: (2023)

Robustness of Online Inventory Balancing to Inventory Shocks
par: Feng, Yiding, et autres
Publié: (2025)

Online Nash Welfare Maximization Without Predictions
par: Huang, Zhiyi, et autres
Publié: (2022)

Static Pricing for Online Selection Problem and its Variants
par: Sun, Bo, et autres
Publié: (2024)

Posted Price Mechanisms for Online Allocation with Diseconomies of Scale
par: Jazi, Hossein Nekouyan, et autres
Publié: (2025)

Addressing Bias in Online Selection with Limited Budget of Comparisons
par: Benomar, Ziyad, et autres
Publié: (2023)

Selfish, Local and Online Scheduling via Vector Fitting
par: Kashaev, Danish
Publié: (2025)

Online Envy Minimization and Multicolor Discrepancy: Equivalences and Separations
par: Halpern, Daniel, et autres
Publié: (2025)

Repeated Descent: A Framework for Online Budget-Feasible Auctions
par: Charalampopoulos, Andreas, et autres
Publié: (2026)

Beyond the Half-Approximation: Fair and Efficient Online Class Matching
par: Borst, Sander, et autres
Publié: (2026)

Online Coalition Formation under Random Arrival or Coalition Dissolution
par: Bullinger, Martin, et autres
Publié: (2023)

Improved Parallel Algorithms for EF1 Allocations
par: Gowda, Kishen N, et autres
Publié: (2026)

A Strongly Polynomial Algorithm for Arctic Auctions
par: Garg, Jugal, et autres
Publié: (2026)

An Algorithm-to-Contract Framework without Demand Queries
par: Doron-Arad, Ilan, et autres
Publié: (2025)