# Efficient Energy Distribution in a Smart Grid using Multi-Player Games

@inproceedings{Brihaye2016EfficientED, title={Efficient Energy Distribution in a Smart Grid using Multi-Player Games}, author={Thomas Brihaye and Amit Kumar Dhar and Gilles Geeraerts and Axel Haddad and Benjamin Monmege}, booktitle={Cassting/SynCoP}, year={2016} }

Algorithms and models based on game theory have nowadays become prominent techniques for the design of digital controllers for critical systems. Indeed, such techniques enable automatic synthesis: given a model of the environment and a property that the controller must enforce, those techniques automatically produce a correct controller, when it exists. In the present paper, we consider a class of concurrent, weighted, multi-player games that are well-suited to model and study the interactions… Expand

#### One Citation

Synthesis of equilibria in infinite-duration

- Computer Science
- ACM SIGLOG News
- 2021

This survey studies multi-player turn-based infinite-duration games played on a finite directed graph such that each player aims at maximizing a payoff function and presents the well-known notions of Nash equilibrium and subgame perfect equilibrium. Expand

#### References

SHOWING 1-10 OF 15 REFERENCES

Multiplayer Cost Games with Simple Nash Equilibria

- Computer Science, Mathematics
- LFCS
- 2013

The existence of Nash equilibria that are composed of k memoryless strategies for each agent in a setting with k agents, one main and k − 1 minor strategies are established and hold a promise of implementability. Expand

Pure Nash Equilibria in Concurrent Deterministic Games

- Computer Science, Mathematics
- Log. Methods Comput. Sci.
- 2015

A novel construction is provided, called the suspect game, which transforms a multi-player concurrent game into a two-player turn-based game which turns Nash equilibria into winning strategies (for some objective that depends on the preference relations of the players in the original game). Expand

Nash Equilibria in Concurrent Priced Games

- Mathematics, Computer Science
- LATA
- 2012

This work provides a construction of a Buchi automaton accepting all Nash equilibria outcomes and shows how this construction can be used to solve a variety of related problems, such as finding pareto-optimal Equilibria. Expand

Synthesis for Multi-objective Stochastic Games: An Application to Autonomous Urban Driving

- Computer Science
- QEST
- 2013

This work studies strategy synthesis for stochastic two-player games with multiple objectives expressed as a conjunction of LTL and expected total reward goals, and takes advantage of randomised memory updates in order to provide compact strategies. Expand

PRISM-games: A Model Checker for Stochastic Multi-Player Games

- Computer Science
- TACAS
- 2013

The tool is based on the probabilistic model checker PRISM, benefiting from its existing user interface and simulator, whilst adding novel model checking algorithms for stochastic games, as well as functionality to synthesise optimal player strategies. Expand

Application of Model-Checking Technology to Controller Synthesis

- Computer Science
- FMCO
- 2010

Two frameworks that have been implemented to link traditional model-checking techniques to the domain of control by solving a timed game and using the resulting solution (a strategy) as a controller are presented. Expand

Equilibrium Points in N-Person Games.

- Mathematics, Medicine
- Proceedings of the National Academy of Sciences of the United States of America
- 1950

One may define a concept of an n -person game in which each player has a finite set of pure strategies and in which a definite set of payments to the n players corresponds to each n -tuple of pure… Expand

Safe and Optimal Adaptive Cruise Control

- Computer Science
- Correct System Design
- 2015

The potential of current model-checking technology for automatic synthesis of optimal yet safe (collision-free) controllers is illustrated on an Adaptive Cruise Control problem, being a small part of the overall safety problem considered by Olderog. Expand

UPPAAL-Tiga: Time for Playing Games!

- Computer Science
- CAV
- 2007

The first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties has now matured to a fully integrated tool with dramatic improvements both in terms of performance and the availability of the extended input language of UPPAAL-4.0. Expand

Uppaal Stratego

- Computer Science
- TACAS
- 2015

Uppaal Stratego is a novel tool which facilitates generation, optimization, comparison as well as consequence and performance exploration of strategies for stochastic priced timed games in a user-friendly manner by maintaining strategies as first class objects in the model-checking query language. Expand