For every finite matroid, one independent sample per element supports an online rule with expected reward at least 2^-310 times the expected offline optimum, even when the arrival-order adversary sees all samples, online values, and the rule’s seed.
For every finite matroid, one independent sample per element supports an online rule with expected reward at least 2^-310 times the expected offline optimum, even when the arrival-order adversary sees all samples, online values, and the rule’s seed.
For every finite matroid, one independent sample per element supports an online rule with expected reward at least 2^-310 times the expected offline optimum, even when the arrival-order adversary sees all samples, online values, and the rule’s seed.
If correct, gives a constant independent of matroid rank under an unusually strong adversarial arrival model.
Can one sample per element support a constant matroid prophet guarantee against a full-seed ordering adversary?
Publication dates and editorial changes.
OpenAI reports a one-sample matroid prophet inequality against full-seed ordering
Allow optional Google Analytics to help improve AIProofWatch? Privacy details.
