Unknown I.I.D. prophets: better bounds, streaming algorithms, and a new impossibility

Correa, Jose, Dütting, Paul, Fischer, Felix, Schewior, Kevin and Ziliotto, Bruno (2020) Unknown I.I.D. prophets: better bounds, streaming algorithms, and a new impossibility. In: Proceedings of the 12th Innovations in Theoretical Computer Science Conference, ITCS'21, forthcoming. ACM Press. (In Press)

	Text (Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility) - Accepted Version Pending embargo until 1 January 2100. Download (232kB)
	Text (LIPIcs.ITCS.2021.86) - Published Version Available under License Creative Commons Attribution. Download (232kB)

• Author

Abstract

A prophet inequality states, for some α ∈ [0, 1], that the expected value achievable by a gambler who sequentially observes random variables X1, . . . , Xn and selects one of them is at least an α fraction of the maximum value in the sequence. We obtain three distinct improvements for a setting that was first studied by Correa et al. (EC, 2019) and is particularly relevant to modern applications in algorithmic pricing. In this setting, the random variables are i.i.d. from an unknown distribution and the gambler has access to an additional βn samples for some β ≥ 0. We first give improved lower bounds on α for a wide range of values of β; specifically, α ≥ (1 + β)/e when β ≤ 1/(e − 1), which is tight, and α ≥ 0.648 when β = 1, which improves on a bound of around 0.635 due to Correa et al. (SODA, 2020). Adding to their practical appeal, specifically in the context of algorithmic pricing, we then show that the new bounds can be obtained even in a streaming model of computation and thus in situations where the use of relevant data is complicated by the sheer amount of data available. We finally establish that the upper bound of 1/e for the case without samples is robust to additional information about the distribution, and applies also to sequences of i.i.d. random variables whose distribution is itself drawn, according to a known distribution, from a finite set of known candidate distributions. This implies a tight prophet inequality for exchangeable sequences of random variables, answering a question of Hill and Kertz (Contemporary Mathematics, 1992), but leaves open the possibility of better guarantees when the number of candidate distributions is small, a setting we believe is of strong interest to applications.

Item Type:	Book Section
Official URL:	https://dl.acm.org/conference/itcs
Additional Information:	© 2020 The Author(s)
Divisions:	Mathematics
Subjects:	Q Science > QA Mathematics Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited:	15 Dec 2020 16:45
Last Modified:	17 Oct 2024 16:59
URI:	http://eprints.lse.ac.uk/id/eprint/107918

Actions (login required)

View Item