Assignment games, chromatic number, and exchange theory

Phillip Bonacich, Elisa Bienenstock

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

The exchange networks that social psychologists have studied can usefully be represented as game theoretic 2-sided assignment games. Conceiving of these networks as 2-sided assignment games opens up the possibility of studying N-sided assignment games and games without cores. 2-sided assignment games are special in that they always have cores, stable solutions in which every individual and subgroup behave rationally. The implicit assignment of positions to categories of an N-sided assignment game is related to coloring a graph. The color classes form sets of positions with potentially related interests. Color equivalence is compared to structural, regular, automorphic, and ecological positional equivalence.

Original languageEnglish (US)
Pages (from-to)243-259
Number of pages17
JournalThe Journal of Mathematical Sociology
Volume17
Issue number4
DOIs
StatePublished - Apr 1 1993
Externally publishedYes

Fingerprint

Game Chromatic number
exchange theory
equivalence
Assignment
Game
psychologist
social network
Equivalence
Stable Solution
Social Networks
Colouring
Subgroup

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Social Sciences (miscellaneous)
  • Sociology and Political Science

Cite this

Assignment games, chromatic number, and exchange theory. / Bonacich, Phillip; Bienenstock, Elisa.

In: The Journal of Mathematical Sociology, Vol. 17, No. 4, 01.04.1993, p. 243-259.

Research output: Contribution to journalArticle

@article{55efbd297b214a18934b31de51333678,
title = "Assignment games, chromatic number, and exchange theory",
abstract = "The exchange networks that social psychologists have studied can usefully be represented as game theoretic 2-sided assignment games. Conceiving of these networks as 2-sided assignment games opens up the possibility of studying N-sided assignment games and games without cores. 2-sided assignment games are special in that they always have cores, stable solutions in which every individual and subgroup behave rationally. The implicit assignment of positions to categories of an N-sided assignment game is related to coloring a graph. The color classes form sets of positions with potentially related interests. Color equivalence is compared to structural, regular, automorphic, and ecological positional equivalence.",
author = "Phillip Bonacich and Elisa Bienenstock",
year = "1993",
month = "4",
day = "1",
doi = "10.1080/0022250X.1993.9990110",
language = "English (US)",
volume = "17",
pages = "243--259",
journal = "Journal of Mathematical Sociology",
issn = "0013-1881",
publisher = "Routledge",
number = "4",

}

TY - JOUR

T1 - Assignment games, chromatic number, and exchange theory

AU - Bonacich, Phillip

AU - Bienenstock, Elisa

PY - 1993/4/1

Y1 - 1993/4/1

N2 - The exchange networks that social psychologists have studied can usefully be represented as game theoretic 2-sided assignment games. Conceiving of these networks as 2-sided assignment games opens up the possibility of studying N-sided assignment games and games without cores. 2-sided assignment games are special in that they always have cores, stable solutions in which every individual and subgroup behave rationally. The implicit assignment of positions to categories of an N-sided assignment game is related to coloring a graph. The color classes form sets of positions with potentially related interests. Color equivalence is compared to structural, regular, automorphic, and ecological positional equivalence.

AB - The exchange networks that social psychologists have studied can usefully be represented as game theoretic 2-sided assignment games. Conceiving of these networks as 2-sided assignment games opens up the possibility of studying N-sided assignment games and games without cores. 2-sided assignment games are special in that they always have cores, stable solutions in which every individual and subgroup behave rationally. The implicit assignment of positions to categories of an N-sided assignment game is related to coloring a graph. The color classes form sets of positions with potentially related interests. Color equivalence is compared to structural, regular, automorphic, and ecological positional equivalence.

UR - http://www.scopus.com/inward/record.url?scp=0000349294&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000349294&partnerID=8YFLogxK

U2 - 10.1080/0022250X.1993.9990110

DO - 10.1080/0022250X.1993.9990110

M3 - Article

VL - 17

SP - 243

EP - 259

JO - Journal of Mathematical Sociology

JF - Journal of Mathematical Sociology

SN - 0013-1881

IS - 4

ER -