Results 11 to 20 of about 86,418 (195)
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
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
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
The THREAT-ARREST Cyber-Security Training Platform [PDF]
, 2020 Cyber security is always a main concern for critical infrastructures and nation-wide safety and sustainability. Thus, advanced cyber ranges and security training is becoming imperative for the involved organizations.
ASA-M Al-Ghamdi +10 more
core +1 more source
Algorithmic aspects of a chip-firing game [PDF]
, 2001 Algorithmic aspects of a chip-firing game on a graph introduced by Biggs are studied. This variant of the chip-firing game, called the dollar game, has the properties that every starting configuration leads to a so-called critical configuration.
van den Heuvel, Jan
core +1 more source
Streaming Hardness of Unique Games [PDF]
, 2018 We study the problem of approximating the value of a Unique Game instance in the streaming model. A simple count of the number of constraints divided by p, the alphabet size of the Unique Game, gives a trivial p-approximation that can be computed in O ...
Guruswami, Venkatesan, Tao, Runzhou
core +2 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
Games on graphs: A minor modification of payoff scheme makes a big difference
, 2014 Various social dilemma games that follow different strategy updating rules have been studied on many networks.The reported results span the entire spectrum, from significantly boosting,to marginally affecting,to seriously decreasing the level of ...
Di, Zengru +4 more
core +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