Graphical Games and Decomposition

03/29/2020
by   Laura Arditti, et al.
0

We consider graphical games as introduced by Kearns et al. (2001). First we analyse the interaction of graphicality with a notion of strategic equivalence of games, providing a minimal complexity graphical description for games. Then we study the interplay between graphicality and the classical decomposition of games proposed by Candogan et al. (2011), characterizing the graphical properties of each part of the decomposition.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/29/2020

Separable games

We introduce the notion of separable games, which refines and generalize...
research
01/18/2019

Decomposition of games: some strategic considerations

Candogan et al. (2011) provide an orthogonal direct-sum decomposition of...
research
07/07/2022

A Comparison of Group Criticality Notions for Simple Games

We analyze two independent efforts to extend the notion of criticality i...
research
05/07/2015

Effects of Nonparanormal Transform on PC and GES Search Accuracies

Liu, et al., 2009 developed a transformation of a class of non-Gaussian ...
research
05/04/2022

Graphical Games for UAV Swarm Control Under Time-Varying Communication Networks

We propose a unified framework for coordinating Unmanned Aerial Vehicle ...
research
11/11/2022

Categorical Semantics for Model Comparison Games for Description Logics

A categorical approach to study model comparison games in terms of comon...
research
09/17/2017

On directed homotopy equivalences and a notion of directed topological complexity

This short note introduces a notion of directed homotopy equivalence and...

Please sign up or login with your details

Forgot password? Click here to reset