The Interactive Sum Choice Number of Trees
Gregory J. Puleo

TL;DR
This paper investigates the interactive sum choice number in trees, providing a recursive formula for forests, establishing its equivalence with the slow coloring cost, and answering an open question in the field.
Contribution
It introduces a recursive formula for the interactive sum choice number of forests and proves its equality with the slow coloring cost, resolving an open problem.
Findings
Recursive formula for forests' interactive sum choice number
Equality of interactive sum choice number and slow coloring cost on forests
Answers a question posed by Bonamy and Meeks
Abstract
We study the interactive sum choice number, a game coloring parameter introduced by Bonamy and Meeks, and obtain a recursive formula for the interactive sum choice number of forests. This formula coincides with a formula for the slow coloring cost of forests, a parameter introduced by Mahoney, Puleo, and West, and shows that these parameters are equal on forests. This answers a question of Bonamy and Meeks.
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
TopicsGame Theory and Voting Systems · Game Theory and Applications · Artificial Intelligence in Games
