Link bias in network formation games

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We show a simple method for constructing an infinite family of graph formation games with link bias so that the resulting games admits, as a pairwise stable solution, a graph with an arbitrarily specified degree distribution. Pairwise stability is used as the equilibrium condition over the more commonly used Nash equilibrium to prevent the occurrence of ill-behaved equilibrium strategies that do not occur in ordinary play. We construct this family of games by solving an integer programming problem whose constraints enforce the terminal pairwise stability property we desire.

Original languageEnglish (US)
Title of host publicationProceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011
Pages684-687
Number of pages4
DOIs
StatePublished - Dec 1 2011
Event2011 IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom 2011 - Boston, MA, United States
Duration: Oct 9 2011Oct 11 2011

Publication series

NameProceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011

Other

Other2011 IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom 2011
CountryUnited States
CityBoston, MA
Period10/9/1110/11/11

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Safety, Risk, Reliability and Quality

Fingerprint Dive into the research topics of 'Link bias in network formation games'. Together they form a unique fingerprint.

Cite this