2017/05/09 by Gregory J. Puleo, Puleo, Gregory J.
Computer Science · Decision Sciences · Economics, Econometrics and Finance · Mathematics · #05C15 #05C57 #Artificial Intelligence in Games #Combinatorics (math.CO) #FOS: Mathematics #Game Theory and Applications #Game Theory and Voting Systems #math.CO #msc:05C15 #msc:05C57
paper · pdf · doi:10.48550/arxiv.1705.03442
This paper has been merged into the joint paper arXiv:1612.04702, and this preprint is therefore now obsolete
openalex publication_date 2017/05/09 · arxiv created 2017/10/02 · arxiv updated 2017/10/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.