A Unified Approach to Restricted Games, Theory and Decision, vol.50, issue.4, pp.333-345, 2001. ,
DOI : 10.1023/A:1010344404281
Wiretapping a Hidden Network, Proceedings of the 5th International Workshop on Internet and Network Economics, WINE '09, pp.438-446, 2009. ,
DOI : 10.1007/978-3-642-10841-9_40
Values of points and arcs in communication situations, 1990. ,
Optimal attack and reinforcement of a network, Journal of the ACM, vol.32, issue.3, pp.549-561, 1985. ,
DOI : 10.1145/3828.3829
Cores of Games with Restricted Cooperation. ZOR -Methods and Models of Operations Research, pp.405-422, 1989. ,
Strongly Polynomial Algorithm for the Intersection of a Line with a Polymatroid In Research Trends in Combinatorial Optimization, pp.69-85, 2008. ,
Submodular Functions and Optimization, Annals of Discrete Mathematics, 2005. ,
The core of games on ordered structures and graphs, 4OR, vol.20, issue.3, pp.207-238, 2009. ,
DOI : 10.1007/s10288-009-0109-9
URL : https://hal.archives-ouvertes.fr/halshs-00445171
Computing the Strength of a Graph, SIAM Journal on Computing, vol.20, issue.4, pp.639-654, 1991. ,
DOI : 10.1137/0220040
Graphs and Cooperation in Games, Mathematics of Operations Research, vol.2, issue.3, pp.225-229, 1977. ,
DOI : 10.1287/moor.2.3.225
Values of Graph-Restricted Games, SIAM Journal on Algebraic Discrete Methods, vol.7, issue.2, pp.210-220, 1986. ,
DOI : 10.1137/0607025
Combinatorial Optimization : Polyhedra and Efficiency, 2003. ,
A new algorithm for the intersection of a line with the independent set polytope of a matroid, Bulletin des Sciences Math??matiques, vol.133, issue.2, pp.169-185, 2009. ,
DOI : 10.1016/j.bulsci.2008.10.003
URL : https://hal.archives-ouvertes.fr/hal-00633952
On the convexity of communication games, International Journal of Game Theory, vol.1, issue.4, pp.421-451, 1991. ,
DOI : 10.1007/BF01766431