The core of games on convex geometries

The core of games on convex geometries

0.00 Avg rating0 Votes
Article ID: iaor20003656
Country: Netherlands
Volume: 119
Issue: 2
Start Page Number: 365
End Page Number: 372
Publication Date: Dec 1999
Journal: European Journal of Operational Research
Authors: , ,
Keywords: programming: convex
Abstract:

A game on a convex geometry is a real-valued function defined on the family ℒ of the closed sets of a closure operator which satisfies the finite Minkowski–Krein–Milman property. If ℒ is the Boolean algebra 2N then we obtain an 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.

Reviews

Required fields are marked *. Your email address will not be published.