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
URL : http://doi.org/10.1016/j.disc.2003.10.019

S. Béal, E. Rémila, and P. Solal, Rooted-tree solutions for tree games, European Journal of Operational Research, vol.203, issue.2, pp.404-408, 2010.
DOI : 10.1016/j.ejor.2009.07.023

J. M. Bilbao, Axioms for the Shapley value on convex geometries, European Journal of Operational Research, vol.110, issue.2, pp.368-376, 1998.
DOI : 10.1016/S0377-2217(97)00263-4

J. M. Bilbao, E. Lebrón, and N. Jiménez, The core of games on convex geometries, European Journal of Operational Research, vol.119, issue.2, pp.365-372, 1999.
DOI : 10.1016/S0377-2217(99)00138-1

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 Kibernetiki, vol.10, pp.119-139, 1963.

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

P. Csóka, P. J. Herings, and L. Kóczy, Balancedness conditions for exact games, Mathematical Methods of Operations Research, vol.62, issue.1, pp.41-52, 2011.
DOI : 10.1007/s00186-011-0348-3

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

W. Dembski, Uniform probability, Journal of Theoretical Probability, vol.87, issue.2, pp.611-626, 1990.
DOI : 10.1007/BF01046100

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

U. Faigle, M. Grabisch, and M. Heyne, Monge extensions of cooperation and communication structures, European Journal of Operational Research, vol.206, issue.1, pp.104-110
DOI : 10.1016/j.ejor.2010.01.043
URL : https://hal.archives-ouvertes.fr/hal-00625336

S. 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.

D. B. Gillies, 3. Solutions to General Non-Zero-Sum Games, Contributions to the Theory of Games IV, pp.47-85, 1959.
DOI : 10.1515/9781400882168-005

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.251-264, 2012.
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

Y. Hwang and P. Sudhölter, Axiomatizations of the core on the universal domain and other natural domains, International Journal of Game Theory, vol.29, issue.4, pp.597-623, 2001.
DOI : 10.1007/s001820100060

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.52.3057

M. A. Pulido and J. Sánchez-soriano, Characterization of the core in games with restricted cooperation, European Journal of Operational Research, vol.175, issue.2, pp.860-869, 2006.
DOI : 10.1016/j.ejor.2005.05.014

D. Schmeidler, Cores of exact games, I, Journal of Mathematical Analysis and Applications, vol.40, issue.1, pp.214-225, 1972.
DOI : 10.1016/0022-247X(72)90045-5

A. Schrijver, Theory of linear and integer programming, J. Wiley & Sons, 1986.

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.