We consider applications of probabilistic techniques in the framework of algorithmic game theory. We focus on three distinct case studies: (i) The exploitation of the probabilistic...
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...
We study two-player games of infinite duration that are played on finite or infinite game graphs. A winning strategy for such a game is positional if it only depends on the current...
We present a visual language for strategies in game theory, which has potential applications in economics, social sciences, and in general science education. This language facilit...
Abstract. In agent-based computational economics, many different trading strategies have been proposed. Given the kinds of market that such trading strategies are employed in, it i...