Fundamental Limits of Throughput and Availability: Applications to prophet inequalities & transaction fee mechanism design
Abstract: This paper studies the fundamental limits of availability and throughput for independent and heterogeneous demands of a limited resource. Availability is the probability that the demands are below the capacity of the resource. Throughput is the expected fraction of the resource that is utilized by the demands. We offer a concentration inequality generator that gives lower bounds on feasible availability and throughput pairs with a given capacity and independent but not necessarily identical distributions of up-to-unit demands. We show that availability and throughput cannot both be poor. These bounds are analogous to tail inequalities on sums of independent random variables, but hold throughout the support of the demand distribution. This analysis gives analytically tractable bounds supporting the unit-demand characterization of Chawla, Devanur, and Lykouris (2023) and generalizes to up-to-unit demands. Our bounds also provide an approach towards improved multi-unit prophet inequalities (Hajiaghayi, Kleinberg, and Sandholm, 2007). They have applications to transaction fee mechanism design (for blockchains) where high availability limits the probability of profitable user-miner coalitions (Chung and Shi, 2023).
- Wassily Hoeffding “On the distribution of the number of successes in independent trials” In The Annals of Mathematical Statistics JSTOR, 1956, pp. 713–721
- Yoshinori Suzuki “An empirical analysis of the optimal overbooking policies for US major airlines” In Transportation Research Part E: Logistics and Transportation Review 38.2 Elsevier, 2002, pp. 135–149
- Andrew V Goldberg and Jason D Hartline “Envy-free auctions for digital goods” In Proceedings of the 4th ACM conference on Electronic commerce, 2003, pp. 29–35
- Dimitris Bertsimas and Sanne De Boer “Simulation-based booking limits for airline revenue management” In Operations Research 53.1 INFORMS, 2005, pp. 90–106
- Mohammad Taghi Hajiaghayi, Robert Kleinberg and Tuomas Sandholm “Automated online mechanism design and prophet inequalities” In AAAI 7, 2007, pp. 58–65
- Gunho Lee and Randy H Katz “Heterogeneity-Aware Resource Allocation and Scheduling in the Cloud” In 3rd USENIX Workshop on Hot Topics in Cloud Computing (HotCloud 11), 2011
- Vitalik Buterin “A next-generation smart contract and decentralized application platform” In white paper 3.37, 2014, pp. 2–1
- E Boyd “The future of pricing: How airline ticket pricing has inspired a revolution” Springer, 2016
- “Fairness-efficiency allocation of CPU-GPU heterogeneous resources” In IEEE Transactions on Services Computing 12.3 IEEE, 2016, pp. 474–488
- “Multi-tenant GPU clusters for deep learning workloads: Analysis and implications” In Technical report, Microsoft Research, 2018
- “Euclidean Distance Bounds for LMI Analytic Centers using a Novel Bound on the Lambert Function” In arXiv preprint arXiv:2004.01115, 2020
- Tim Roughgarden “Transaction fee mechanism design for the Ethereum blockchain: An economic analysis of EIP-1559” In arXiv preprint arXiv:2012.00854, 2020
- “Dynamic posted-price mechanisms for the blockchain transaction-fee market” In Proceedings of the 3rd ACM Conference on Advances in Financial Technologies, 2021, pp. 86–99
- Tim Roughgarden “Transaction fee mechanism design” In ACM SIGecom Exchanges 19.1 ACM New York, NY, USA, 2021, pp. 52–55
- “Empirical analysis of eip-1559: Transaction fees, waiting times, and consensus security” In Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022, pp. 2099–2113
- “Tight guarantees for static threshold policies in the prophet secretary problem” In Operations research 71.5 INFORMS, 2023, pp. 1777–1788
- Shuchi Chawla, Nikhil Devanur and Thodoris Lykouris “Static pricing for multi-unit prophet inequalities” In Operations Research INFORMS, 2023
- “Foundations of transaction fee mechanism design” In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2023, pp. 3856–3899 SIAM
- Jiashuo Jiang, Will Ma and Jiawei Zhang “Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities” In Proceedings of the 24th ACM Conference on Economics and Computation, EC ’23 , London, United Kingdom,: Association for Computing Machinery, 2023, pp. 909 DOI: 10.1145/3580507.3597734
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.