
Equilibria for Games with Combined Qualitative and Quantitative Objectives
The overall aim of our research is to develop techniques to reason about...
read it

Nash Equilibrium and Bisimulation Invariance
Game theory provides a wellestablished framework for the analysis of co...
read it

Equilibrium Design for Concurrent Games
In game theory, mechanism design is concerned with the design of incenti...
read it

ExplorationExploitation in MultiAgent Learning: Catastrophe Theory Meets Game Theory
Explorationexploitation is a powerful and practical tool in multiagent...
read it

On Parameterized Complexity of Binary Networked Public Goods Game
In the Binary Networked Public Goods game, every player needs to decide ...
read it

Synthesizing safe coalition strategies
Concurrent games with a fixed number of agents have been thoroughly stud...
read it

Probabilistic sensitivity of Nash equilibria in multiagent games: a waitandjudge approach
Motivated by electric vehicle charging control problems, we consider mul...
read it
Equilibria in Quantitative Concurrent Games
Synthesis of finitestate controllers from highlevel specifications in multiagent systems can be reduced to solving multiplayer concurrent games over finite graphs. The complexity of solving such games with qualitative objectives for agents, such as reaching a target set, is well understood resulting in tools with applications in robotics. In this paper, we introduce quantitative concurrent graph games, where transitions have separate costs for different agents, and each agent attempts to reach its target set while minimizing its own cost along the path. In this model, a solution to the game corresponds to a set of strategies, one per agent, that forms a Nash equilibrium. We study the problem of computing the set of all Paretooptimal Nash equilibria, and give a comprehensive analysis of its complexity and related problems such as the price of stability and the price of anarchy. In particular, while checking the existence of a Nash equilibrium is NPcomplete in general, with multiple parameters contributing to the computational hardness separately, twoplayer games with bounded costs on individual transitions admit a polynomialtime solution.
READ FULL TEXT
Comments
There are no comments yet.