TL;DR
This paper develops online approximation algorithms for block packing in blockchain systems with multidimensional constraints, addressing open problems in the field.
Contribution
It introduces new online algorithms for multidimensional block packing, advancing the theoretical understanding of blockchain resource allocation.
Findings
Provides the first online approximation algorithms for the problem.
Solves open problems posed by Babaioff and Nisan (2025).
Enhances blockchain efficiency with multidimensional constraints.
Abstract
We consider the algorithmic challenge that is faced by blockchains that have multidimensional block constraints and serve quasi-patient bidders. We provide online approximation algorithms for this problem, thus solving open problems left by [Babaioff and Nisan, EC 2025].
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Manufacturing and Logistics Optimization · Optimization and Packing Problems