Link bias in network formation games

Shaun Lichter; Terry Friesz; Christopher Griffin

doi:10.1109/PASSAT/SocialCom.2011.61

Link bias in network formation games

Shaun Lichter, Terry Friesz, Christopher Griffin

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English (US)
Title of host publication	Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011
Pages	684-687
Number of pages	4
DOIs	https://doi.org/10.1109/PASSAT/SocialCom.2011.61
State	Published - 2011
Event	2011 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 2011 → Oct 11 2011

Publication series

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

Other

Other	2011 IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom 2011
Country/Territory	United States
City	Boston, MA
Period	10/9/11 → 10/11/11

All Science Journal Classification (ASJC) codes

Hardware and Architecture
Safety, Risk, Reliability and Quality

Access to Document

10.1109/PASSAT/SocialCom.2011.61

Cite this

Lichter, S., Friesz, T., & Griffin, C. (2011). Link bias in network formation games. In Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011 (pp. 684-687). Article 6113197 (Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011). https://doi.org/10.1109/PASSAT/SocialCom.2011.61

Lichter, Shaun ; Friesz, Terry ; Griffin, Christopher. / Link bias in network formation games. Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011. 2011. pp. 684-687 (Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011).

@inproceedings{7e472b82d1754b6caeecec445b3f482e,

title = "Link bias in network formation games",

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.",

author = "Shaun Lichter and Terry Friesz and Christopher Griffin",

year = "2011",

doi = "10.1109/PASSAT/SocialCom.2011.61",

language = "English (US)",

isbn = "9780769545783",

series = "Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011",

pages = "684--687",

booktitle = "Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011",

note = "2011 IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2011 and 2011 IEEE International Conference on Social Computing, SocialCom 2011 ; Conference date: 09-10-2011 Through 11-10-2011",

}

Lichter, S, Friesz, T & Griffin, C 2011, Link bias in network formation games. in Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011., 6113197, Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011, pp. 684-687, 2011 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, 10/9/11. https://doi.org/10.1109/PASSAT/SocialCom.2011.61

Link bias in network formation games. / Lichter, Shaun; Friesz, Terry ; Griffin, Christopher.
Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011. 2011. p. 684-687 6113197 (Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Link bias in network formation games

AU - Lichter, Shaun

AU - Friesz, Terry

AU - Griffin, Christopher

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

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

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

U2 - 10.1109/PASSAT/SocialCom.2011.61

DO - 10.1109/PASSAT/SocialCom.2011.61

M3 - Conference contribution

AN - SCOPUS:84856142186

SN - 9780769545783

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

SP - 684

EP - 687

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

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

Y2 - 9 October 2011 through 11 October 2011

ER -

Lichter S, Friesz T , Griffin C. Link bias in network formation games. In Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011. 2011. p. 684-687. 6113197. (Proceedings - 2011 IEEE International Conference on Privacy, Security, Risk and Trust and IEEE International Conference on Social Computing, PASSAT/SocialCom 2011). doi: 10.1109/PASSAT/SocialCom.2011.61

Link bias in network formation games

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this