A Unifying Model for Matching Situations

J. Tejada, P.E.M. Borm, E.R.M.A. Lohmann

Research output: Working paperDiscussion paperOther research output

237 Downloads (Pure)

Abstract

Abstract: We present a unifying framework for transferable utility coalitional games that are derived from a non-negative matrix in which every entry represents the value obtained by combining the corresponding row and column. We assume that every row and every column is associated with a player, and that every player is associated with at most one row and at most one column. The instances arising from this framework are called matching games, and they encompass assignment games and permutation games as two polar cases. We show that the core of a matching game is always nonempty by proving that the set of matching games coincides with the set of permutation games. Then we focus on two separate problems. First, we exploit the wide range of situations comprised in our framework to investigate the relationship between matching games with different player sets but defined by the same underlying matrix. We show that the core is not only immune to the merging of a row player and a column player, but also to the reverse manipulation, i.e., to the splitting of a player into a row player and a column player. Other common solution concepts fail to be either merging-proof or splitting-proof in general. Second, we focus on permutation games only and we analyze the set of all matrices that define permutation games with the same core. In contrast to assignment games, we show that there can be multiple matrices whose entries cannot be raised without modifying the core of the corresponding permutation game and that, for small instances, every such matrix defines an exact game.
Original languageEnglish
Place of PublicationTilburg
PublisherEconometrics
Number of pages28
Volume2013-069
Publication statusPublished - 2013

Publication series

NameCentER Discussion Paper
Volume2013-069

Fingerprint

Merging

Keywords

  • matching situations
  • permutation games
  • assignment games

Cite this

Tejada, J., Borm, P. E. M., & Lohmann, E. R. M. A. (2013). A Unifying Model for Matching Situations. (CentER Discussion Paper; Vol. 2013-069). Tilburg: Econometrics.
Tejada, J. ; Borm, P.E.M. ; Lohmann, E.R.M.A. / A Unifying Model for Matching Situations. Tilburg : Econometrics, 2013. (CentER Discussion Paper).
@techreport{18155a8c1961495da20df2ea76bbbc78,
title = "A Unifying Model for Matching Situations",
abstract = "Abstract: We present a unifying framework for transferable utility coalitional games that are derived from a non-negative matrix in which every entry represents the value obtained by combining the corresponding row and column. We assume that every row and every column is associated with a player, and that every player is associated with at most one row and at most one column. The instances arising from this framework are called matching games, and they encompass assignment games and permutation games as two polar cases. We show that the core of a matching game is always nonempty by proving that the set of matching games coincides with the set of permutation games. Then we focus on two separate problems. First, we exploit the wide range of situations comprised in our framework to investigate the relationship between matching games with different player sets but defined by the same underlying matrix. We show that the core is not only immune to the merging of a row player and a column player, but also to the reverse manipulation, i.e., to the splitting of a player into a row player and a column player. Other common solution concepts fail to be either merging-proof or splitting-proof in general. Second, we focus on permutation games only and we analyze the set of all matrices that define permutation games with the same core. In contrast to assignment games, we show that there can be multiple matrices whose entries cannot be raised without modifying the core of the corresponding permutation game and that, for small instances, every such matrix defines an exact game.",
keywords = "matching situations, permutation games, assignment games",
author = "J. Tejada and P.E.M. Borm and E.R.M.A. Lohmann",
note = "Pagination: 28",
year = "2013",
language = "English",
volume = "2013-069",
series = "CentER Discussion Paper",
publisher = "Econometrics",
type = "WorkingPaper",
institution = "Econometrics",

}

Tejada, J, Borm, PEM & Lohmann, ERMA 2013 'A Unifying Model for Matching Situations' CentER Discussion Paper, vol. 2013-069, Econometrics, Tilburg.

A Unifying Model for Matching Situations. / Tejada, J.; Borm, P.E.M.; Lohmann, E.R.M.A.

Tilburg : Econometrics, 2013. (CentER Discussion Paper; Vol. 2013-069).

Research output: Working paperDiscussion paperOther research output

TY - UNPB

T1 - A Unifying Model for Matching Situations

AU - Tejada, J.

AU - Borm, P.E.M.

AU - Lohmann, E.R.M.A.

N1 - Pagination: 28

PY - 2013

Y1 - 2013

N2 - Abstract: We present a unifying framework for transferable utility coalitional games that are derived from a non-negative matrix in which every entry represents the value obtained by combining the corresponding row and column. We assume that every row and every column is associated with a player, and that every player is associated with at most one row and at most one column. The instances arising from this framework are called matching games, and they encompass assignment games and permutation games as two polar cases. We show that the core of a matching game is always nonempty by proving that the set of matching games coincides with the set of permutation games. Then we focus on two separate problems. First, we exploit the wide range of situations comprised in our framework to investigate the relationship between matching games with different player sets but defined by the same underlying matrix. We show that the core is not only immune to the merging of a row player and a column player, but also to the reverse manipulation, i.e., to the splitting of a player into a row player and a column player. Other common solution concepts fail to be either merging-proof or splitting-proof in general. Second, we focus on permutation games only and we analyze the set of all matrices that define permutation games with the same core. In contrast to assignment games, we show that there can be multiple matrices whose entries cannot be raised without modifying the core of the corresponding permutation game and that, for small instances, every such matrix defines an exact game.

AB - Abstract: We present a unifying framework for transferable utility coalitional games that are derived from a non-negative matrix in which every entry represents the value obtained by combining the corresponding row and column. We assume that every row and every column is associated with a player, and that every player is associated with at most one row and at most one column. The instances arising from this framework are called matching games, and they encompass assignment games and permutation games as two polar cases. We show that the core of a matching game is always nonempty by proving that the set of matching games coincides with the set of permutation games. Then we focus on two separate problems. First, we exploit the wide range of situations comprised in our framework to investigate the relationship between matching games with different player sets but defined by the same underlying matrix. We show that the core is not only immune to the merging of a row player and a column player, but also to the reverse manipulation, i.e., to the splitting of a player into a row player and a column player. Other common solution concepts fail to be either merging-proof or splitting-proof in general. Second, we focus on permutation games only and we analyze the set of all matrices that define permutation games with the same core. In contrast to assignment games, we show that there can be multiple matrices whose entries cannot be raised without modifying the core of the corresponding permutation game and that, for small instances, every such matrix defines an exact game.

KW - matching situations

KW - permutation games

KW - assignment games

M3 - Discussion paper

VL - 2013-069

T3 - CentER Discussion Paper

BT - A Unifying Model for Matching Situations

PB - Econometrics

CY - Tilburg

ER -

Tejada J, Borm PEM, Lohmann ERMA. A Unifying Model for Matching Situations. Tilburg: Econometrics. 2013. (CentER Discussion Paper).