Partial cooperation and convex sets.

J. Enrique Romero García; Jorge J. López Vázquez

SORT (2003)

  • Volume: 27, Issue: 2, page 139-152
  • ISSN: 1696-2281

Abstract

top
We consider games of transferable utility, those that deal with partial cooperation situations, made up of coalition systems, in which every unit coalition is feasible and every coalition of players can be expressed as a disjoint union of maximal feasible coalitions. These systems are named partition systems and cause restricted games. To sum up, we study feasible coalition systems delined by a partial order designed for a set of players and we analyze the characteristics of a feasible coalition system developed from a family of convex sets.

How to cite

top

Romero García, J. Enrique, and López Vázquez, Jorge J.. "Partial cooperation and convex sets.." SORT 27.2 (2003): 139-152. <http://eudml.org/doc/40441>.

@article{RomeroGarcía2003,
abstract = {We consider games of transferable utility, those that deal with partial cooperation situations, made up of coalition systems, in which every unit coalition is feasible and every coalition of players can be expressed as a disjoint union of maximal feasible coalitions. These systems are named partition systems and cause restricted games. To sum up, we study feasible coalition systems delined by a partial order designed for a set of players and we analyze the characteristics of a feasible coalition system developed from a family of convex sets.},
author = {Romero García, J. Enrique, López Vázquez, Jorge J.},
journal = {SORT},
keywords = {Juegos cooperativos; Juegos con utilidad transferible; Conjuntos convexos; cooperative games; partial cooperation; convex sets},
language = {eng},
number = {2},
pages = {139-152},
title = {Partial cooperation and convex sets.},
url = {http://eudml.org/doc/40441},
volume = {27},
year = {2003},
}

TY - JOUR
AU - Romero García, J. Enrique
AU - López Vázquez, Jorge J.
TI - Partial cooperation and convex sets.
JO - SORT
PY - 2003
VL - 27
IS - 2
SP - 139
EP - 152
AB - We consider games of transferable utility, those that deal with partial cooperation situations, made up of coalition systems, in which every unit coalition is feasible and every coalition of players can be expressed as a disjoint union of maximal feasible coalitions. These systems are named partition systems and cause restricted games. To sum up, we study feasible coalition systems delined by a partial order designed for a set of players and we analyze the characteristics of a feasible coalition system developed from a family of convex sets.
LA - eng
KW - Juegos cooperativos; Juegos con utilidad transferible; Conjuntos convexos; cooperative games; partial cooperation; convex sets
UR - http://eudml.org/doc/40441
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.