Weighted Tree Games

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.

Authors

Patrick Bennett (ORCID: https://orcid.org/0000-0003-3147-4690)
Alan Frieze (ORCID: https://orcid.org/0000-0002-8481-5615)

Institutions

Western Michigan University (US)
Carnegie Mellon University (US)

Publication Details

Journal: The Electronic Journal of Combinatorics
Published: 2025-04-24
DOI: https://doi.org/10.37236/12569
Primary Topic: Artificial Intelligence in Games
Type: article
Field-Weighted Citation Impact: 0.00

Funders

National Science Foundation

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Weighted Tree Games

Patrick Bennett, Alan Frieze

Apr 24, 2025

The Electronic Journal of Combinatorics

Artificial Intelligence in Games

article

Weighted Tree Games

Patrick Bennett, Alan Frieze

April 24, 2025article en

Abstract

The Electronic Journal of CombinatoricsVol. 32(2)

Western Michigan University (US), Carnegie Mellon University (US)

National Science Foundation

Openalex Percentile: Top 96%

Artificial Intelligence in Games

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Weighted Tree Games — Patrick Bennett, Alan Frieze · The Electronic Journal of Combinatorics (2025) | TGRS Research Map | TGRS