The core of games on convex geometries
A game on a convex geometry is a real-valued function defined on the family L of the closed
sets of a closure operator which satisfies the finite Minkowski–Krein–Milman property. If L is
the Boolean algebra 2N then we obtain a n-person cooperative game. We will introduce
convex and quasi-convex games on convex geometries and we will study some properties
of the core and the Weber set of these games.
sets of a closure operator which satisfies the finite Minkowski–Krein–Milman property. If L is
the Boolean algebra 2N then we obtain a n-person cooperative game. We will introduce
convex and quasi-convex games on convex geometries and we will study some properties
of the core and the Weber set of these games.
A game on a convex geometry is a real-valued function defined on the family L of the closed sets of a closure operator which satisfies the finite Minkowski–Krein–Milman property. If L is the Boolean algebra 2N then we obtain a n-person cooperative game. We will introduce convex and quasi-convex games on convex geometries and we will study some properties of the core and the Weber set of these games.
Elsevier
Showing the best result for this search. See all results