no. 3
Convexity of graph-restricted games induced by minimum partitions
RAIRO - Operations Research - Recherche Opérationnelle, Tome 53 (2019) no. 3, pp. 841-866

We consider restricted games on weighted graphs associated with minimum partitions. We replace in the classical definition of Myerson restricted game the connected components of any subgraph by the sub-components corresponding to a minimum partition. This minimum partition 𝒫min is i nduced by the deletion of the minimum weight edges. We provide five necessary conditions on the graph edge-weights to have inheritance of convexity from the underlying game to the restricted game associated with 𝒫min. Then, we establish that these conditions are also sufficient for a weaker condition, called ℱ-convexity, obtained by restriction of convexity to connected subsets. Moreover, we prove that inheritance of convexity for Myerson restricted game associated with a given graph G is equivalent to inheritance of ℱ-convexity for the 𝒫min-restricted game associated with a particular weighted graph G′ built from G by adding a dominating vertex, and with only two different edge-weights. Then, we prove that G is cycle-complete if and only if a specific condition on adjacent cycles is satisfied on G′.

Reçu le :
Accepté le :
DOI : 10.1051/ro/2017069
Classification : 91A12, 91A43, 90C27, 05C75
Keywords: Communication networks, cooperative game, convex game, restricted game, partitions

Skoda, Alexandre 1

1 
@article{RO_2019__53_3_841_0,
     author = {Skoda, Alexandre},
     title = {Convexity of graph-restricted games induced by minimum partitions},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {841--866},
     year = {2019},
     publisher = {EDP Sciences},
     volume = {53},
     number = {3},
     doi = {10.1051/ro/2017069},
     zbl = {1432.91015},
     mrnumber = {3975704},
     language = {en},
     url = {https://www.numdam.org/articles/10.1051/ro/2017069/}
}
TY  - JOUR
AU  - Skoda, Alexandre
TI  - Convexity of graph-restricted games induced by minimum partitions
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2019
SP  - 841
EP  - 866
VL  - 53
IS  - 3
PB  - EDP Sciences
UR  - https://www.numdam.org/articles/10.1051/ro/2017069/
DO  - 10.1051/ro/2017069
LA  - en
ID  - RO_2019__53_3_841_0
ER  - 
%0 Journal Article
%A Skoda, Alexandre
%T Convexity of graph-restricted games induced by minimum partitions
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2019
%P 841-866
%V 53
%N 3
%I EDP Sciences
%U https://www.numdam.org/articles/10.1051/ro/2017069/
%R 10.1051/ro/2017069
%G en
%F RO_2019__53_3_841_0
Skoda, Alexandre. Convexity of graph-restricted games induced by minimum partitions. RAIRO - Operations Research - Recherche Opérationnelle, Tome 53 (2019) no. 3, pp. 841-866. doi: 10.1051/ro/2017069

E. Algaba, Extensión de juegos definidos en sistemas de conjuntos. Ph.D. thesis, Univ. of Seville (1998).

E. Algaba, J. Bilbao, P. Borm and J. Lopez, The position value for union stable systems. Math. Methods Oper. Res. 52 (2000) 221–236. | Zbl | MR | DOI

E. Algaba, J. Bilbao and J. Lopez, A unified approach to restricted games. Theory Decis. 50 (2001) 333–345. | Zbl | MR | DOI

J.M. Bilbao, Cooperative games on combinatorial structures. Kluwer Academic Publishers, Boston (2000). | Zbl | MR | DOI

J.M. Bilbao, Cooperative games under augmenting systems. SIAM J. Discrete Math. 17 (2003) 122–133. | Zbl | MR | DOI

P. Borm, G. Owen and S. Tijs, Values of points and arcs in communication situations. Technical Report 9004, Dept of Mathematics, University of Nijmegen, The Netherlands (1990).

J. Edmonds and R. Giles, A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1 (1977) 185–204. | Zbl | MR | DOI

U. Faigle, Cores of games with restricted cooperation. ZOR – Methods Models. Oper. Res. 33 (1989) 405–422. | Zbl | MR

U. Faigle, M. Grabisch and M. Heyne, Monge extensions of cooperation and communication structures. Eur. J. Oper. Res. 206 (2010) 104–110. | Zbl | MR | DOI

S. Fujishige, Submodular Functions and Optimization. Vol. 58 of Ann. Discrete Math. Elsevier, 2nd edition (2005). | Zbl | MR

M. Grabisch, The core of games on ordered structures and graphs. Ann. Oper. Res. 204 (2013) 33–64. | Zbl | MR | DOI

M. Grabisch and A. Skoda, Games induced by the partitioning of a graph. Ann. Oper. Res. 201 (2012) 229–249. | Zbl | MR | DOI

R. Myerson, Graphs and cooperation in games. Math. Oper. Res. 2 (1977) 225–229. | Zbl | MR | DOI

A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency. Springer-Verlag (2003). | Zbl | MR

A. Skoda, Complexity of inheritance of ℱ-convexity for restricted games induced by minimum partitions. Documents de travail du Centre d’Economie de la Sorbonne 2016.55 – ISSN: 1955-611X (2016).

A. Skoda, Inheritance of convexity for partition restricted games. Discrete Optimiz. 25 (2017) 6–27. | Zbl | MR | DOI

A. Skoda, Inheritance of Convexity for the 𝒫min-Restricted Game. Preprint Hal:halshs-01660670 (2017). | MR

A. Van Den Nouweland and P. Borm, On the convexity of communication games. Int. J. Game Theory 19 (1991) 421–430. | Zbl | MR | DOI

Cité par Sources :