An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Paul Dütting, Thomas Kesselheim, Brendan Lucier. An O(log log m) Prophet Inequality for Subadditive Combinatorial Auctions. In 61st IEEE Annual Symposium on Foundations of Computer Science, FOCS 2020, Durham, NC, USA, November 16-19, 2020. pages 306-317, IEEE, 2020. [doi]

The following publications are possibly variants of this publication:

An O(log log m) prophet inequality for subadditive combinatorial auctionsPaul Dütting, Thomas Kesselheim, Brendan Lucier. sigecom, 18(2):32-37, 2020. [doi]

Simplified Prophet Inequalities for Combinatorial AuctionsAlexander Braun, Thomas Kesselheim. sosa 2023: 381-389 [doi]

Prophet Secretary for Combinatorial Auctions and MatroidsSoheil Ehsani, MohammadTaghi Hajiaghayi, Thomas Kesselheim, Sahil Singla. soda 2018: 700-714 [doi]

runs on WebDSL