Image de couverture de livre

Threshold Policies with Tight Guarantees for Online Selection with Convex Costs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Tan, Xiaoqi, Yu, Siyuan, Boutaba, Raouf, Leon-Garcia, Alberto
Format:	Preprint
Publié:	2023
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

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

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)

Online Allocation with Multi-Class Arrivals: Group Fairness vs Individual Welfare
par: Zargari, Faraz, et autres
Publié: (2025)

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

Choosing Behind the Veil: Tight Bounds for Identity-Blind Online Algorithms
par: Ezra, Tomer, et autres
Publié: (2024)

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

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

Static Pricing Guarantees for Queueing Systems
par: Bergquist, Jacob, et autres
Publié: (2023)

Approximation Algorithms for the Weighted Nash Social Welfare via Convex and Non-Convex Programs
par: Brown, Adam, et autres
Publié: (2024)

Best of Both Worlds Guarantees for Equitable Allocations
par: Bhaskar, Umang, et autres
Publié: (2025)

Best-of-Both-Worlds Guarantees with Fairer Endings
par: Kavitha, Telikepalli, et autres
Publié: (2025)

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

Group Fair Matchings using Convex Cost Functions
par: Panda, Atasi, et autres
Publié: (2025)

Online Fair Allocation with Best-of-Many-Worlds Guarantees
par: Yang, Zongjun, et autres
Publié: (2024)

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

Prophet Inequalities with Cancellation Costs
par: Ekbatani, Farbod, et autres
Publié: (2024)

Online Fair Division: Towards Ex-Post Constant MMS Guarantees
par: Kulkarni, Pooja, et autres
Publié: (2025)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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)

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

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

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

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

A Competitive Posted-Price Mechanism for Online Budget-Feasible Auctions
par: Charalampopoulos, Andreas, et autres
Publié: (2025)

Edge-weighted Online Stochastic Matching Under Jaillet-Lu LP
par: Yan, Shuyi
Publié: (2025)