Weighted tree games
Combinatorics
2023-11-21 v1
Abstract
We consider a variation on Maker-Breaker games on graphs or digraphs where the edges have random costs. We assume that Maker wishes to choose the edges of a spanning tree, but wishes to minimise his cost. Meanwhile Breaker wants to make Maker's cost as large as possible.
Cite
@article{arxiv.2311.11154,
title = {Weighted tree games},
author = {Patrick Bennett and Alan Frieze},
journal= {arXiv preprint arXiv:2311.11154},
year = {2023}
}