Abstract
In this paper we introduce the Matroid Cup Game. This cup game generalizes the One- and p-Cup Games. We show that a natural greedy strategy maintains max fill O(logn) in the Matroid Cup Game with mild resource augmentation. Further, we introduce a new objective for cup game: the total water, which is the amount of water across all cups. We develop a novel Emptier strategy that maintain O(rn) total water without resource augmentation. We also reveal a novel relationship between max fill and total water, which leads to an intuitive analysis of the max fill bounds in the One- and p-Cup Games.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
