We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...
Martin Marciniszyn, Dieter Mitsche, Milos Stojakov...
— We examine the social behaviors of game experts in Everquest II, a popular massive multiplayer online role-playing game (MMO). We rely on Exponential Random Graph Models (ERGM)...
David Huffaker, Jing (Annie) Wang, Jeffrey William...
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
Abraham Flaxman, David Gamarnik, Gregory B. Sorkin
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...