Link Monotonic Allocation Schemes

M. Slikker

Research output: Working paperDiscussion paperOther research output

238 Downloads (Pure)

Abstract

A network is a graph where the nodes represent players and the links represent bilateral interaction between the players. A reward game assigns a value to every network on a fixed set of players. An allocation scheme specifies how to distribute the worth of every network among the players. This allocation scheme is link monotonic if extending the network does not decrease the payoff of any player. We characterize the class of reward games that have a link monotonic allocation scheme. Two allocation schemes for reward games are studied, the Myerson allocation scheme and the position allocation scheme, which are both based on allocation rules for communication situations. We introduce two notions of convexity in the setting of reward games and with these notions of convexity we characterize the classes of reward games where the Myerson allocation scheme and the position allocation scheme are link monotonic. As a by-product we find a characterization of the Myerson value and the position value on the class of reward games using potentials.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages19
Volume1999-06
Publication statusPublished - 1999

Publication series

NameCentER Discussion Paper
Volume1999-06

Fingerprint

Byproducts
Communication

Keywords

  • network
  • reward game
  • monotonic allocation scheme

Cite this

Slikker, M. (1999). Link Monotonic Allocation Schemes. (CentER Discussion Paper; Vol. 1999-06). Tilburg: Operations research.
Slikker, M. / Link Monotonic Allocation Schemes. Tilburg : Operations research, 1999. (CentER Discussion Paper).
@techreport{42bfa59cdba6427eac489914d9b4780c,
title = "Link Monotonic Allocation Schemes",
abstract = "A network is a graph where the nodes represent players and the links represent bilateral interaction between the players. A reward game assigns a value to every network on a fixed set of players. An allocation scheme specifies how to distribute the worth of every network among the players. This allocation scheme is link monotonic if extending the network does not decrease the payoff of any player. We characterize the class of reward games that have a link monotonic allocation scheme. Two allocation schemes for reward games are studied, the Myerson allocation scheme and the position allocation scheme, which are both based on allocation rules for communication situations. We introduce two notions of convexity in the setting of reward games and with these notions of convexity we characterize the classes of reward games where the Myerson allocation scheme and the position allocation scheme are link monotonic. As a by-product we find a characterization of the Myerson value and the position value on the class of reward games using potentials.",
keywords = "network, reward game, monotonic allocation scheme",
author = "M. Slikker",
note = "Pagination: 19",
year = "1999",
language = "English",
volume = "1999-06",
series = "CentER Discussion Paper",
publisher = "Operations research",
type = "WorkingPaper",
institution = "Operations research",

}

Slikker, M 1999 'Link Monotonic Allocation Schemes' CentER Discussion Paper, vol. 1999-06, Operations research, Tilburg.

Link Monotonic Allocation Schemes. / Slikker, M.

Tilburg : Operations research, 1999. (CentER Discussion Paper; Vol. 1999-06).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - Link Monotonic Allocation Schemes

AU - Slikker, M.

N1 - Pagination: 19

PY - 1999

Y1 - 1999

N2 - A network is a graph where the nodes represent players and the links represent bilateral interaction between the players. A reward game assigns a value to every network on a fixed set of players. An allocation scheme specifies how to distribute the worth of every network among the players. This allocation scheme is link monotonic if extending the network does not decrease the payoff of any player. We characterize the class of reward games that have a link monotonic allocation scheme. Two allocation schemes for reward games are studied, the Myerson allocation scheme and the position allocation scheme, which are both based on allocation rules for communication situations. We introduce two notions of convexity in the setting of reward games and with these notions of convexity we characterize the classes of reward games where the Myerson allocation scheme and the position allocation scheme are link monotonic. As a by-product we find a characterization of the Myerson value and the position value on the class of reward games using potentials.

AB - A network is a graph where the nodes represent players and the links represent bilateral interaction between the players. A reward game assigns a value to every network on a fixed set of players. An allocation scheme specifies how to distribute the worth of every network among the players. This allocation scheme is link monotonic if extending the network does not decrease the payoff of any player. We characterize the class of reward games that have a link monotonic allocation scheme. Two allocation schemes for reward games are studied, the Myerson allocation scheme and the position allocation scheme, which are both based on allocation rules for communication situations. We introduce two notions of convexity in the setting of reward games and with these notions of convexity we characterize the classes of reward games where the Myerson allocation scheme and the position allocation scheme are link monotonic. As a by-product we find a characterization of the Myerson value and the position value on the class of reward games using potentials.

KW - network

KW - reward game

KW - monotonic allocation scheme

M3 - Discussion paper

VL - 1999-06

T3 - CentER Discussion Paper

BT - Link Monotonic Allocation Schemes

PB - Operations research

CY - Tilburg

ER -

Slikker M. Link Monotonic Allocation Schemes. Tilburg: Operations research. 1999. (CentER Discussion Paper).