Network Topology, Higher Orders of Stability and Efficiency

Subhadip Chakrabarti, Supanit Tangsangasaksri

Research output: Contribution to journalArticlepeer-review

199 Downloads (Pure)

Abstract

Stable networks of order r where r is a natural number refer to those networks that are immune to coalitional deviation of size r or less. In this paper, we introduce stability of a finite order and examine its relation with efficient networks under anonymous and component additive value functions and the component-wise egalitarian allocation rule. In particular, we examine shapes of networks or network architectures that would resolve the conflict between stability and efficiency in the sense that if stable networks assume those shapes they would be efficient and if efficient networks assume those shapes, they would be stable with minimal further restrictions on value functions.
Original languageEnglish
Article number1450010
Number of pages21
JournalInternational Game Theory Review
Volume16
Issue number4
Early online date05 Jun 2014
DOIs
Publication statusPublished - 01 Dec 2014

Keywords

  • Stability of order r
  • Efficiency
  • Network architecture

Fingerprint Dive into the research topics of 'Network Topology, Higher Orders of Stability and Efficiency'. Together they form a unique fingerprint.

Cite this