Results 1 to 10 of about 86,031 (183)
Fast strategies in biased Maker--Breaker games [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 We study the biased $(1:b)$ Maker--Breaker positional games, played on the edge set of the complete graph on $n$ vertices, $K_n$. Given Breaker's bias $b$, possibly depending on $n$, we determine the bounds for the minimal number of moves, depending on ...
Mirjana Mikalački, Miloš Stojaković
doaj +1 more source
Path Planning Problems with Side Observations-When Colonels Play Hide-and-Seek [PDF]
, 2019 Resource allocation games such as the famous Colonel Blotto (CB) and Hide-and-Seek (HS) games are often used to model a large variety of practical problems, but only in their one-shot versions.
Loiseau, Patrick +3 more
core +3 more sources
The Complexity of Rationalizing Network Formation [PDF]
, 2008 We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making individual decisions to form or not form incident edges.
Kalyanaraman, Shankar +1 more
core +5 more sources
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
New Journal of Physics, 2016 We study the classical and quantum values of a class of one- and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes.
M Rosicka +6 more
doaj +1 more source
Subsampling Mathematical Relaxations and Average-case Complexity [PDF]
, 2010 We initiate a study of when the value of mathematical relaxations such as linear and semidefinite programs for constraint satisfaction problems (CSPs) is approximately preserved when restricting the instance to a sub-instance induced by a small random ...
Barak, Boaz +3 more
core +3 more sources
, 2014 Positional games are a branch of combinatorics, researching a variety of two-player games, ranging from popular recreational games such as Tic-Tac-Toe and Hex, to purely abstract games played on graphs and hypergraphs.
Krivelevich, Michael
core +1 more source
Leaders should not be conformists in evolutionary social dilemmas [PDF]
, 2016 The most common assumption in evolutionary game theory is that players should adopt a strategy that warrants the highest payoff. However, recent studies indicate that the spatial selection for cooperation is enhanced if an appropriate fraction of the ...
Perc, Matjaz, Szolnoki, Attila
core +3 more sources
Inapproximability of the Standard Pebble Game and Hard to Pebble Graphs
, 2017 Pebble games are single-player games on DAGs involving placing and moving pebbles on nodes of the graph according to a certain set of rules. The goal is to pebble a set of target nodes using a minimum number of pebbles.
CH Bennett +4 more
core +1 more source
Navigating the Landscape of Multiplayer Games
, 2020 Multiplayer games have long been used as testbeds in artificial intelligence research, aptly referred to as the Drosophila of artificial intelligence. Traditionally, researchers have focused on using well-known games to build strong agents. This progress,
Connor, Jerome +11 more
core +1 more source
Infinite subgame perfect equilibrium in the Hausdorff difference hierarchy
, 2015 Subgame perfect equilibria are specific Nash equilibria in perfect information games in extensive form. They are important because they relate to the rationality of the players. They always exist in infinite games with continuous real-valued payoffs, but
Roux, Stephane Le
core +2 more sources