Picker–Chooser fixed graph games
نویسندگان
چکیده
منابع مشابه
Graph Saturation Games
We study F-saturation games, first introduced by Füredi, Reimer and Seress [1] in 1991, and named as such by West [2]. A graph G is H-saturated if H is not a subgraph of G, but adding any edge to G causes H to be a subgraph. We can ask what the minimum or maximum number of edges in an H-saturated graph on n vertices is they are known as the saturation number and Turán number (extremal number), ...
متن کاملBayesian Action-Graph Games
Games of incomplete information, or Bayesian games, are an important gametheoretic model and have many applications in economics. We propose Bayesian action-graph games (BAGGs), a novel graphical representation for Bayesian games. BAGGs can represent arbitrary Bayesian games, and furthermore can compactly express Bayesian games exhibiting commonly encountered types of structure including symmet...
متن کاملAsymmetric graph coloring games
We introduce the (a; b)-coloring game, an asymmetric version of the coloring game played by two players Alice and Bob on a finite graph, which differs from the standard version in that, in each turn, Alice colors a vertices and Bob colors b vertices. We also introduce a related game, the (a; b)-marking game. We analyze these games and determine the (a; b)chromatic numbers and (a;b)-coloring num...
متن کاملGraph Games on Ordinals
We consider an extension of Church’s synthesis problem to ordinals by adding limit transitions to graph games. We consider game arenas where these limit transitions are defined using the sets of cofinal states. In a previous paper, we have shown that such games of ordinal length are determined and that the winner problem is PSPACE-complete, for a subclass of arenas where the length of plays is ...
متن کاملAction-Graph Games
Action-Graph Games (AGGs) are a fully expressive game representation which can compactly express strict and context-specific independence and anonymity structure in players’ utility functions. We present an efficient algorithm for computing expected payoffs under mixed strategy profiles. This algorithm runs in time polynomial in the size of the AGG representation (which is itself polynomial in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2016
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2015.12.008