Year: 2025
Type: article
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.
DOI: 10.37236/12569
Authors: Patrick Bennett, Alan Frieze
Institutions: Western Michigan University, Carnegie Mellon University
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: diamond
Funder: National Science Foundation
OpenAlex ID: W4409766264