加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本