?. ,

, Toute intersection de fermés est un fermé

, L'union d'un nombre fini de fermés est un fermé

, Si ? et ? sont deux topologies sur E, on dira que ? est plus fine que ? si tout ouvert de

. Un-voisinage-d'unélément-x-?-e-est-une-partie-de-e-contenant-un, L'ensemble des voisinages de x sera noté V(x). L'espace topologique (E, ? ) est séparé si pour tout couple de points distincts, peut trouver deux voisinages V ? V(x) et W ? V(y) tels que V ? W = ?

, ) est compact s'il est séparé et si de tout recouvrement d'ouverts de E on peut extraire un sous-recouvrement fini

(. Si and ?. ,

, E ) est un treillis, On peut vérifier que

. Deux and . .. De-shapley, , vol.64

. .. , Jeux de graphes pondérés sur un produit de chaines, p.66

, Calcul de la valeur de Shapley par les dividendes de Harsanyi, p.75

.. .. Conclusion,

H. Adachi, On a characterization of stable matchings, Economics Letters, vol.68, pp.43-49, 2000.

E. Algaba, Cooperative games on antimatroids, Discrete Mathematics, vol.282, pp.1-15, 2004.

K. J. Arrow, G. Et, and . Debreu, Existence of an Equilibrium for a Competitive Economy, Econometrica 22, vol.3, p.129682, 1954.

R. J. Aumann, The Core of a Cooperative Game without Side Payments, Transactions of the American Mathematical Society, vol.98, pp.539-552, 1961.

J. Baixeries, Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice, Formal Concept Analysis, 7th International Conference, pp.162-177, 2009.

M. Barbut, Partitions d'un ensemble fini : leur treillis (cosimplexe) et leur représentation géométrique . fr, Mathématiques et Sciences humaines, vol.22, pp.5-22, 1968.

K. Bertet and B. Monjardet, The multiple facets of the canonical direct unit implicational basis, In : Theor. Comput. Sci, vol.411, pp.2155-2166, 2010.
URL : https://hal.archives-ouvertes.fr/halshs-00308798

J. M. Bilbao, Cooperative Games on Combinatorial Structures, Theory and Decision Library. Springer US. isbn, pp.978-979, 2000.

, Cooperative Games under Augmenting Systems, SIAM Journal on Discrete Mathematics, vol.17, pp.122-133, 2003.

J. M. Bilbao and P. H. Edelman, The Shapley value on convex geometries, Discrete Applied Mathematics, vol.103, pp.166-218, 2000.

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.99, pp.138-139, 1999.

J. M. Bilbao and M. Ordoñez, The core and the Weber set of games on augmenting systems, Discrete Applied Mathematics, vol.158, pp.180-188, 2010.

G. Birkhoff, Lattice Theory, colloquium publications, vol.25, p.9780821810255, 1967.

C. Blair, Every finite distributive lattice is a set of stable matchings, Journal of Combinatorial Theory, Series A, vol.37, pp.90056-90062, 1984.

, The Lattice Structure of the Set of Stable Matchings with Multiple Partners, Mathematics of Operations Research 13, vol.4, pp.619-628, 1988.

O. Bondareva, Certain applications of the methods of linear programming to the theory of cooperative games, pp.119-139, 1963.

J. Bordat, Calul pratique du treillis de galois d'une correspondance, In : Math. Sci. Hum, vol.96, pp.31-47, 1986.

S. Boyd and L. Vandenberghe, Convex Optimization, p.521833787, 2004.

R. Brânzei, V. Fragnelli, and S. Tijs, Tree-connected peer group situations and peer group games, Mathematical Methods of Operations Research, vol.55, issue.1, pp.1432-5217, 2002.

G. Brightwell and P. Winkler, Counting linear extensions . English, Order 8.3, pp.167-8094, 1991.

R. Bubley and M. Dyer, Faster random generation of linear extensions, Discrete Mathematics, vol.201, pp.333-334, 1999.

J. I. Bulow, J. D. Geanakoplos, and P. D. Klemperer, Multimarket Oligopoly : Strategic Substitutes and Complements, Journal of Political Economy, vol.93, pp.488-511, 1985.

L. Comtet, Advanced Combinatorics. The art of finite and infinite expansions, P.O. Box, vol.17, 1974.

S. A. Cook, The Complexity of Theorem-proving Procedures, Proceedings of the Third Annual ACM Symposium on Theory of Computing. STOC '71, pp.151-158, 1971.

X. Deng and C. H. Papadimitriou, On the complexity of cooperative solution concepts, Mathematics of Operations Research 19, vol.2, pp.257-266, 1994.

J. Derks and R. P. Gilles, Hierarchical organization structures and constraints on coalition formation, International Journal of Game Theory, vol.24, pp.20-7276, 1995.

J. Derks and H. Peters, Orderings, excess functions, and the nucleolus, Mathematical Social Sciences, vol.36, issue.2, pp.175-182, 1998.

. Dias and M. F. Vânia, The stable marriage problem with restricted pairs, Theoretical Computer Science, vol.306, pp.391-405, 2003.

R. P. Dilworth, Lattices with Unique Irreducible Decompositions, Annals of Mathematics 41, vol.4, p.3486, 1940.

F. Echenique, Finding all equilibria in games of strategic complements, Journal of Economic Theory, vol.135, pp.514-532, 2007.

P. H. Edelman and R. E. Jamison, The theory of convex geometries, Geometriae Dedicata 19, vol.3, pp.1572-9168, 1985.

K. Ewacha, I. Rival, and N. Zaguia, Approximating the number of linear extensions, Theoretical Computer Science, vol.175, issue.96, pp.203-207, 1997.

U. Faigle, Cores of games with restricted cooperation, Zeitschrift für Operations Research 33, vol.6, pp.405-422, 1989.

U. Faigle, M. Grabisch, and M. Heyne, Monge extensions of cooperation and communication structures, European Journal of Operational Research, vol.206, pp.377-2217, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00625336

U. Faigle, M. Grabisch, and A. Jiménez-losada, Games on concept lattices : Shapley value and core, Discrete Applied Mathematics, vol.198, pp.166-218, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01379699

U. Faigle and W. Kern, The Shapley value for cooperative games under precedence constraints, International Journal of Game Theory, vol.21, pp.20-7276, 1992.

D. S. Felsenthal, . Et-moshé, and . Machover, Ternary voting games, International Journal of Game Theory, vol.26, pp.335-351, 1997.

S. Felsner and T. Manneville, Linear Extensions of N-free Orders, Order 32, vol.2, pp.147-155, 2014.

. Frink and . Orrin, Topology in Lattices, Transactions of the American Mathematical Society, vol.51, p.29947, 1942.

D. Gale and L. S. Shapley, College Admissions and the Stability of Marriage, The American Mathematical Monthly, vol.69, pp.9-15, 1962.

M. R. Garey and D. S. Johnson, Computers and Intractability.A Guide to the Theory of NPCompleteness, 1979.

V. K. Garg, Y. Narahari, and M. Narasimha-murty, Novel Biobjective Clustering (BiGC) Based on Cooperative Game Theory, Knowledge and Data Engineering, vol.25, pp.1041-4347, 2013.

I. E. Gilboa and . Lehrer, Global games, International Journal of Game Theory, vol.20, pp.129-147, 1991.
URL : https://hal.archives-ouvertes.fr/hal-00753233

R. P. Gilles, The Core of a Cooperative Game, The Cooperative Game Theory of Networks and Hierarchies. T. 44. Theory and Decision Library C, pp.29-70, 2010.

R. P. Gilles, G. Owen, and R. Brink, Games with permission structures : The conjunctive approach, International Journal of Game Theory, vol.20, pp.277-293, 1992.

D. B. Gillies, Solutions to General Non-Zero Sum Games, Contributions to the theory of games. Sous la dir, vol.40, pp.47-86, 1959.

M. Grabisch, The core of games on ordered structures and graphs, Annals of Operations Research, vol.204, pp.33-64, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00803233

M. Grabisch, I. Kojadinovic, and P. Meyer, kappalab : Non-additive measure and integral manipulation functions, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00868577

M. Grabisch and C. Labreuche, Fuzzy Measures and Integrals in MCDA, Multiple Criteria Decision Analysis, pp.563-608, 2004.
URL : https://hal.archives-ouvertes.fr/halshs-00268985

, Derivative of functions over lattices as a basis for the notion of interaction between attributes, Bi-capacities. Part 1 : definition, Mobius transform and interaction, vol.2, pp.151-170, 2005.

, A decade of application of the Choquet and Sugeno integrals in multi-criteria decision aid, pp.4-6, 2008.

M. Grabisch and F. Lange, Games on lattices, multichoice games and the shapley value : a new approach, Mathematical Methods of Operations Research, vol.65, issue.1, pp.1432-5217, 2007.
URL : https://hal.archives-ouvertes.fr/halshs-00178916

G. Grätzer, Lattice Theory : Foundation, Springer Basel AG. isbn, pp.978-981, 2011.

M. Habib and L. Nourine, Representation of lattices via set-colored posets, Discrete Applied Mathematics. issn, pp.166-218, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01955233

C. Hsiao and T. E. Raghavan, Shapley Value for Multichoice Cooperative Games, I, Games and Economic Behavior, vol.5, pp.899-8256, 1993.

T. Ichiishi, Super-modularity : Applications to convex games and to the greedy algorithm for LP, Journal of Economic Theory, vol.25, issue.81, pp.90007-90014, 1981.

R. W. Irving and P. Leather, The Complexity of Counting Stable Marriages, SIAM J. Comput, vol.15, issue.3, pp.97-5397, 1986.

R. W. Irving, P. Leather, and D. Gusfield, An Efficient Algorithm for the "Optimal" Stable Marriage, J. ACM, vol.34, issue.3, pp.4-5411, 1987.

T. W. Judson, Abstract Algebra. Theory and application, 2012.

R. M. Karp, Reducibility among Combinatorial Problems, and sponsored by the Office of Naval Research, Mathematics Program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department, pp.85-103, 1972.
DOI : 10.1007/978-3-540-68279-0_8

D. E. Knuth, Mariages stables. Les Presses de l'Université de Montréal, pp.2-7606, 1976.

K. Kollias and . Et-t.-roughgarden, Automata, Languages and Programming : 38th International Colloquium, Proceedings, Part II, pp.539-551, 2011.

B. Korte and J. Vygen, Combinatorial Optimization, Theory and Algorithms, 2002.

S. O. Kuznetsov and S. A. Obiedkov, Algorithms for the Construction of Concept Lattices and Their Diagram Graphs, Principles of Data Mining and Knowledge Discovery, 5th European Conference, pp.289-300, 2001.

L. Lovász, Mathematical Programming The State of the Art. Sous la dir. d'Achim Bachem, Bernhard Korte et Martin Grötschel, pp.978-981, 1983.

K. Maafa, L. Nourine, and M. S. Radjef, Algorithms for computing the Shapley value of cooperative games on lattices, Discrete Applied Mathematics. issn, pp.166-218, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01702536

K. Maafa and M. S. Radjef, Jeux Multicritères avec Interactions entre Critères, Actes du Colloque sur l'Opitmisation et les Systèmes d'information, 2014.

H. Mannila and K. Räihä, On the complexity of inferring functional dependencies, Discrete Applied Mathematics, vol.40, pp.90031-90036, 1992.

J. Marichal, Behavioral Analysis of Aggregation in Multicriteria Decision Aid, Preferences and Decisions under Incomplete Knowledge. Sous la dir. de János Fodor, Bernard Baets et Patrice Perny. T. 51. Studies in Fuzziness and Soft Computing, pp.153-178, 2000.

T. P. Michalak, Efficient Computation of the Shapley Value for Game-Theoretic Network Centrality, Journal of Artificial Intelligence Research, vol.46, pp.607-650, 2013.

P. Milgrom and J. Roberts, Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities, Econometrica 58, vol.6, pp.1255-77, 1990.

P. Milgrom and C. Shannon, Monotone Comparative Statics, p.129682, 1994.

R. H. Möhring, Algorithms and Order, Dordrecht : Springer Netherlands. Chap. Computationally Tractable Classes of Ordered Sets, pp.105-193, 1989.

B. Monjardet, Mathematical Theories of Allocation of Discrete Resources :Equilibria,Matchings,Mechanisms, Why . In : Mathematical Social Sciences, vol.46, issue.2, pp.72-78, 2003.

T. Murofushi and M. Sugeno, Some quantities represented by the Choquet integral, Fuzzy Sets and Systems 56, vol.2, p.90148, 1993.

J. F. Nash, Equilibrium points in n-person games, Proceedings of the National Academy of Sciences, vol.36, pp.48-49, 1950.

L. Nourine and O. Raynaud, A Fast Algorithm for Building Lattices, Inf. Process. Lett, vol.71, pp.199-204, 1999.
URL : https://hal.archives-ouvertes.fr/hal-01765512

A. Nouweland, Cores and related solution concepts for multi-choice games, Zeitschrift für Operations Research 41, vol.3, pp.1432-5217, 1995.

B. Peleg and P. Sudhölter, R : A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, 2007.

M. S. Radjef and K. Fahem, A note on ideal Nash equilibrium in multicriteria games, Applied Mathematics Letters, vol.21, pp.1105-1111, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00716317

A. E. Roth, The Shapley value. Essays in honor of Lloyd S. Shapley, 1988.

J. Rothe, Sous la dir. de Leon A. Petrosyan et Nikolay A. Zenkevich. Contributions to game theory and management II, The Second International Conference Game Theory and Management, vol.II, pp.363-382, 2009.

T. Sandholm, Coalition structure generation with worst case guarantees, Artificial Intelligence 111.1-2, pp.36-39, 1999.

D. Schmeidler, Integral Representation Without Additivity, Proceedings of the, pp.255-261, 1986.

L. S. Shapley, A value for n-person games, Contributions to the Theory of Games (AM 28), pp.307-317, 1953.

, On balanced sets and cores, Naval Research Logistics Quarterly, vol.14, pp.11-26, 1967.

B. Stanley and H. P. Sankappanavar, A Course in Universal Algebra, 2012.

R. P. Stanley, Enumerative Combinatorics, vol.1, p.9781107602625, 2011.

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, In : Pacific Journal of Mathematics, vol.5, pp.285-309, 1955.

R. M. Thrall and W. F. Lucas, N-person games in partition function form, Naval Research Logistics Quarterly, vol.10, pp.281-298, 1963.

D. M. Topkis, Equilibrium Points in Nonzero-Sum n-Person Submodular Games, SIAM Journal on Control and Optimization, vol.26, pp.773-787, 1978.

L. G. Valiant, The complexity of computing the permanent, In : Theoretical Computer Science, vol.8, pp.90044-90050, 1979.

X. Vives, Nash equilibrium with strategic complementarities, Journal of Mathematical Economics, vol.19, pp.305-321, 1990.

V. Neumann, J. , and O. Morgenstern, Theory of games and economic behavior, 1944.

M. Voorneveld, S. Grahn, and M. Dufwenburg, Ideal equilibria in noncooperative multicriteria games, Mathematical Methods of Operations Research, vol.52, pp.65-77, 2000.

R. J. Weber, Probabilistic values for games, The Shapley value. Sous la dir. d'Alvin E. Roth. Cambridge Books Online, pp.101-120, 1988.

M. Wild, The joy of implications, aka pure Horn functions : mainly a survey, Computations with Finite Closure Systems and Implications . In : Computing and Combinatorics, First Annual International Conference, COCOON '95, pp.111-120, 1995.

L. Xie and M. Grabisch, The core of games on k-regular set systems. Documents de travail du Centre d'Economie de la Sorbonne, 2009.
URL : https://hal.archives-ouvertes.fr/halshs-00423922

L. Zhou, The Set of Nash Equilibria of a Supermodular Game is a Complete Lattice, Games and Economic Behaviour, vol.7, pp.295-300, 1994.