E. Algaba, J. M. Bilbao, R. Van-den, A. Brink, and . Jiménez-losada, Cooperative games on antimatroids, Discrete Mathematics, vol.282, issue.1-3, pp.1-15, 2004.
DOI : 10.1016/j.disc.2003.10.019

J. M. Bilbao, N. Jiménez, E. Lebrón, and H. Peters, The selectope for games with partial cooperation, Discrete Mathematics, vol.216, issue.1-3, pp.11-27, 2000.
DOI : 10.1016/S0012-365X(99)00294-0

J. M. Bilbao and P. H. Edelman, The Shapley value on convex geometries, Discrete Applied Mathematics, vol.103, issue.1-3, pp.33-40, 2000.
DOI : 10.1016/S0166-218X(99)00218-8

G. Birkhoff, On the combination of subalgebras, Proc. Camb, pp.441-464, 1933.

O. Bondareva, Some applications of linear programming to the theory of cooperative games, Problemy Kibernet, vol.10, pp.119-139, 1963.

G. Brightwell and P. Winkler, Counting linear extensions. Order, pp.225-242, 1991.

B. A. Davey and H. A. Priestley, Introduction to Lattices and Orders, 1990.
DOI : 10.1017/CBO9780511809088

J. Derks and R. Gilles, Hierarchical organization structures and constraints on coalition formation, International Journal of Game Theory, vol.18, issue.2, pp.147-163, 1995.
DOI : 10.1007/BF01240039

U. Faigle and W. Kern, The Shapley value for cooperative games under precedence constraints, International Journal of Game Theory, vol.25, issue.3, pp.249-266, 1992.
DOI : 10.1007/BF01258278

. Fujishige, Submodular functions and optimization, Annals of Discrete Mathematics, vol.58, 2005.

S. Fujishige and N. Tomizawa, A note on submodular functions on distributive lattices, J. of the Operations Research Society of Japan, vol.26, pp.309-318, 1983.

M. Grabisch, The core of games on ordered structures and graphs, pp.207-238, 2009.
URL : https://hal.archives-ouvertes.fr/halshs-00445171

M. Grabisch, Ensuring the boundedness of the core of games with restricted cooperation, Annals of Operations Research, vol.33, issue.1, pp.137-154, 2011.
DOI : 10.1007/s10479-011-0920-5
URL : https://hal.archives-ouvertes.fr/halshs-00544134

M. Grabisch and P. Sudhölter, The bounded core for games with precedence constraints, Annals of Operations Research, vol.14, issue.1, pp.10479-10491
DOI : 10.1007/s10479-012-1228-9
URL : https://hal.archives-ouvertes.fr/hal-00759893

M. Grabisch and L. J. Xie, The restricted core of games on distributive lattices: how to share benefits in a hierarchy, Mathematical Methods of Operations Research, vol.33, issue.5, pp.189-208, 2011.
DOI : 10.1007/s00186-010-0341-2
URL : https://hal.archives-ouvertes.fr/halshs-00583868

M. Grabisch and L. J. Xie, The restricted core of games on distributive lattices: how to share benefits in a hierarchy, Mathematical Methods of Operations Research, vol.33, issue.5, 2008.
DOI : 10.1007/s00186-010-0341-2
URL : https://hal.archives-ouvertes.fr/halshs-00583868

T. Ichiishi, Super-modularity: Applications to convex games and to the greedy algorithm for LP, Journal of Economic Theory, vol.25, issue.2, pp.283-286, 1981.
DOI : 10.1016/0022-0531(81)90007-7

G. Pruesse and F. Ruskey, Generating Linear Extensions Fast, SIAM Journal on Computing, vol.23, issue.2, pp.373-386, 1994.
DOI : 10.1137/S0097539791202647

L. S. Shapley, Cores of convex games, International Journal of Game Theory, vol.57, issue.1, pp.11-26, 1971.
DOI : 10.1007/BF01753431

N. Tomizawa, Theory of hyperspace (XVI)?on the structure of hedrons. Papers of the Technical Group on Circuits and Systems CAS82-172, 1983.