Link Monotonic Allocation Schemes

M. Slikker

Research output: Working paperDiscussion paperOther research output

300 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

Keywords

  • network
  • reward game
  • monotonic allocation scheme

Fingerprint Dive into the research topics of 'Link Monotonic Allocation Schemes'. Together they form a unique fingerprint.

Cite this