Mini-workshop: Positional games. Abstracts from the mini-workshop held September 30 -- October 6, 2018
Collections of abstracts of lectures (00B05) Proceedings of conferences of miscellaneous specific interest (00B25) Games on graphs (graph-theoretic aspects) (05C57) Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Proceedings, conferences, collections, etc. pertaining to game theory, economics, and finance (91-06) Positional games (pursuit and evasion, etc.) (91A24) Games involving graphs (91A43) Combinatorial games (91A46)
Summary: This mini-workshop focused on Positional Games and related fields. Positional Games Theory is a branch of Combinatorics whose main aim is to systematically develop an extensive mathematical basis for a variety of two-player games of perfect information and without chance moves, usually played on discrete objects. These include popular recreational games such as Tic-Tac-Toe and Hex as well as purely abstract games played on graphs and hypergraphs. Though a close relative of the classical Game Theory of von Neumann and of Nim-like games, popularized by Conway and others, Positional Games are quite different and are more of a combinatorial nature. The subject is strongly related to several other branches of Combinatorics like Ramsey Theory, Extremal Graph and Set Theory, and the Probabilistic Method. It has also proven to be instrumental in deriving central results in Theoretical Computer Science, in particular in derandomization and algorithmization of important probabilistic tools. Despite being a relatively young topic, there are already three textbooks dedicated to Positional Games as well as one invited talk at the International Congress of Mathematicians. During this mini-workshop, several new exciting developments in the field were presented and discussed. We have also made some progress towards solving various open problems in Positional Games Theory and related areas.
- Mini-workshop: Positional games. Abstracts from the mini-workshop held April 8--14, 2007.
- Minimax theory and applications. Proceedings of the workshop, Erice, Italy, September 30--October 6, 1996
- scientific article; zbMATH DE number 932175
- A minicourse on topological games
- On two theorems of positional games
- scientific article; zbMATH DE number 3982947
- Minimal and locally minimal games and game forms
- Mini-workshop: Algebraic, geometric, and combinatorial methods in frame theory. Abstracts from the mini-workshop held September 30 -- October 6, 2018
- Positional games
- Positional games
- Conditions on Ramsey nonequivalence
- scientific article; zbMATH DE number 3665001 (Why is no real title available?)
- scientific article; zbMATH DE number 3520447 (Why is no real title available?)
- On Ramsey Minimal Graphs
- On Ramsey minimal graphs
- On the use of senders in generalized Ramsey theory for graphs
- Ramsey equivalence of \(K_n\) and \(K_n+K_{n-1}\)
- Ramsey-minimal graphs for star-forests
- The Ramsey property for graphs with forbidden complete subgraphs
- What is Ramsey-equivalent to a clique?
This page was built for publication: Mini-workshop: Positional games. Abstracts from the mini-workshop held September 30 -- October 6, 2018
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782958)
