Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, January 20, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Miloš Stojaković
We introduce and study Maker/Breaker-type positional games on
Our main concern is to determine the threshold probability p_F for the
existence of Maker's strategy to claim a member of F in the unbiased game
played on the edges of random graph G(n,p), for various target families F
of winning sets. More generally, for each probability above this threshold
we study the smallest bias b such that Breaker wins the (1:b) biased game.
We investigate these functions for a number of basic games, like the connectivity game, the perfect matching game, the clique game and the Hamiltonian cycle game.
This is joint work with Tibor Szabo.
Automatic MiSe System Software Version 1.4803M | admin login