Using network control structures, this paper introduces a general class of network communication games and studies their decomposition into unanimity games. We obtain a relation between the dividends in any network communication game and its underlying transferable utility game, which depends on the structure of the communication network. Moreover, we introduce a new class of network control values which contains both the Myerson value and the position value. The decomposition results are used to explicitly express these values in terms of dividends
This paper examines a normal form game of network formation due to Myerson (Game theory: analysis o...
We introduce an efficient solution for games with communication graph structures and show that it is...
We introduce an Owen-type value for games with two-level communication structure, which is a structu...
Using network control structures, this paper introduces a general class of network communication gam...
Using network control structures this paper introduces network communication games as a generalizati...
We reconsider the Myerson value and the position value for communication situations. In case the und...
We consider a new model of a TU game endowed with both coalition and two-level communication structu...
Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly ta...
In this tutorial, we provided a comprehensive overview of coalitional game theory, and its usage in ...
Previous allocation rules for network games, such as the Myerson value, implicitly or explicitly ta...
In this paper, we deal with a coordination game in a network where a player can choose both an actio...
International audienceGame theoretical techniques have recently become prevalent in many engineering...
International audienceIn this paper we investigate the problem of optimal games played over networks...
A mathematical tool for scientists and researchers who work with computer and communication networks...
National audienceWe formulate a generic network game as a generalized Nash equilibrium problem. Rely...
This paper examines a normal form game of network formation due to Myerson (Game theory: analysis o...
We introduce an efficient solution for games with communication graph structures and show that it is...
We introduce an Owen-type value for games with two-level communication structure, which is a structu...
Using network control structures, this paper introduces a general class of network communication gam...
Using network control structures this paper introduces network communication games as a generalizati...
We reconsider the Myerson value and the position value for communication situations. In case the und...
We consider a new model of a TU game endowed with both coalition and two-level communication structu...
Previous allocation rules for network games, such as the Myerson Value, implicitly or explicitly ta...
In this tutorial, we provided a comprehensive overview of coalitional game theory, and its usage in ...
Previous allocation rules for network games, such as the Myerson value, implicitly or explicitly ta...
In this paper, we deal with a coordination game in a network where a player can choose both an actio...
International audienceGame theoretical techniques have recently become prevalent in many engineering...
International audienceIn this paper we investigate the problem of optimal games played over networks...
A mathematical tool for scientists and researchers who work with computer and communication networks...
National audienceWe formulate a generic network game as a generalized Nash equilibrium problem. Rely...
This paper examines a normal form game of network formation due to Myerson (Game theory: analysis o...
We introduce an efficient solution for games with communication graph structures and show that it is...
We introduce an Owen-type value for games with two-level communication structure, which is a structu...