Universal online contention resolution with preselected order

DOI10.4230/LIPICS.ICALP.2025.137MaRDI QIDQ7397596zbMATH OpenFDO

Authors

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2025.137

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• A stochastic probing problem with applications
• Advances on matroid secretary problems: free order model and laminar case
• scientific article; zbMATH DE number 7829290 (Why is no real title available?)
• Matroids, secretary problems, and online mechanisms
• Multi-parameter mechanism design and sequential posted pricing
• Online contention resolution schemes with applications to Bayesian selection problems
• Order selection prophet inequality: from threshold optimization to arrival time design
• Pairwise-independent contention resolution
• Prophet Inequalities and Order Selection in Optimal Stopping Problems
• Random order contention resolution schemes
• Submodular function maximization via the multilinear relaxation and contention resolution schemes
• The outer limits of contention resolution on matroids and connections to the secretary problem

This page was built for publication: Universal online contention resolution with preselected order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7397596)