Geodesic
Weighted tree games
Patrick Bennett1 ; Alan Frieze2
1Western Michigan University
2Carnegie Mellon University
The electronic journal of combinatorics, Tome 32 (2025) no. 2
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

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
Classification : 05C57, 05C20, 91A43, 05C05
Mots-clés : maker-breaker game, random costs

Patrick Bennett  1   ; Alan Frieze  2

1 Western Michigan University
2 Carnegie Mellon University 
@article{10_37236_12569,
     author = {Patrick Bennett and Alan Frieze},
     title = {Weighted tree games},
     journal = {The electronic journal of combinatorics},
     year = {2025},
     volume = {32},
     number = {2},
     doi = {10.37236/12569},
     zbl = {1564.05218},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/12569/}
}
TY  - JOUR
AU  - Patrick Bennett
AU  - Alan Frieze
TI  - Weighted tree games
JO  - The electronic journal of combinatorics
PY  - 2025
VL  - 32
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.37236/12569/
DO  - 10.37236/12569
ID  - 10_37236_12569
ER  - 
%0 Journal Article
%A Patrick Bennett
%A Alan Frieze
%T Weighted tree games
%J The electronic journal of combinatorics
%D 2025
%V 32
%N 2
%U http://geodesic.mathdoc.fr/articles/10.37236/12569/
%R 10.37236/12569
%F 10_37236_12569
Patrick Bennett; Alan Frieze. Weighted tree games. The electronic journal of combinatorics, Tome 32 (2025) no. 2. doi: 10.37236/12569

Cité par Sources :