Cooperative Product Games
Computer Science and Game Theory
2014-02-03 v1
Abstract
I introduce cooperative product games (CPGs), a cooperative game where every player has a weight, and the value of a coalition is the product of the weights of the players in the coalition. I only look at games where the weights are at least . I show that no player in such a game can be a dummy. I show that the game is convex, and therefore always has a non-empty core. I provide a simple method for finding a payoff vector in the core.
Cite
@article{arxiv.1401.8144,
title = {Cooperative Product Games},
author = {David Rosales},
journal= {arXiv preprint arXiv:1401.8144},
year = {2014}
}