Inequality and network structure
We explore the manner in which the structure of a social network constrains the level of inequality that can be sustained among its members, based on the following considerations: (i) any distribution of value must be stable with respect to coalitional deviations, and (ii) the network structure itse...
Gespeichert in:
Veröffentlicht in: | Games and economic behavior 2011-09, Vol.73 (1), p.215-226 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 226 |
---|---|
container_issue | 1 |
container_start_page | 215 |
container_title | Games and economic behavior |
container_volume | 73 |
creator | Kets, Willemien Iyengar, Garud Sethi, Rajiv Bowles, Samuel |
description | We explore the manner in which the structure of a social network constrains the level of inequality that can be sustained among its members, based on the following considerations: (i) any distribution of value must be stable with respect to coalitional deviations, and (ii) the network structure itself determines the coalitions that may form. We show that if players can jointly deviate only if they form a clique in the network, then the degree of inequality that can be sustained depends on the cardinality of the maximum independent set. For bipartite networks, the size of the maximum independent set fully characterizes the degree of inequality that can be sustained. This result extends partially to general networks and to the case in which a group of players can deviate jointly if they are all sufficiently close to each other in the network.
► This paper studies how the structure of a social network constrains the level of inequality that can be sustained. ► If a group of players in a network can deviate only when they are directly connected, a key determinant is the size of the maximum independent set of the network. ► In bipartite networks, the size of the maximum independent set fully characterizes the maximum level of inequality that can be sustained. ► A partial characterization is provided for general networks. |
doi_str_mv | 10.1016/j.geb.2010.12.007 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_884842181</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0899825611000029</els_id><sourcerecordid>2427560311</sourcerecordid><originalsourceid>FETCH-LOGICAL-c529t-5b6492d12e453f36f15071673f60caa1f548e8b1a7df145ae8c47e7eb2b32bd3</originalsourceid><addsrcrecordid>eNp9kEtPwzAQhC0EEuXxA7hVXDileP2IHXFCFY-iSlx6txxnUxLapLWTov57HAVx4MBhPVprZrT6CLkBOgMK6X09W2M-Y3TY2YxSdUImQDOaMKH4KZlQnWWJZjI9Jxch1JRSyRSdkOmiwX1vN1V3nNqmmDbYfbX-cxo637uu93hFzkq7CXj9o5dk9fy0mr8my_eXxfxxmTjJsi6ReSoyVgBDIXnJ0xIkVZAqXqbUWQulFBp1DlYVJQhpUTuhUGHOcs7ygl-Su7F259t9j6Ez2yo43Gxsg20fjNZCCwYaovP2j7Nue9_E26KJZ5AKNZhgNDnfhuCxNDtfba0_GqBmAGZqE4GZAZgBZiKwmHkbMx536H4DiLi2W8zRHAy3isfnGCcmIUoVZ9Dd8AXSMJaaj24byx7GMozMDhV6E1yFjcOi8ug6U7TVP6d8A0Ftii4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>883916471</pqid></control><display><type>article</type><title>Inequality and network structure</title><source>RePEc</source><source>Elsevier ScienceDirect Journals Complete</source><creator>Kets, Willemien ; Iyengar, Garud ; Sethi, Rajiv ; Bowles, Samuel</creator><creatorcontrib>Kets, Willemien ; Iyengar, Garud ; Sethi, Rajiv ; Bowles, Samuel</creatorcontrib><description>We explore the manner in which the structure of a social network constrains the level of inequality that can be sustained among its members, based on the following considerations: (i) any distribution of value must be stable with respect to coalitional deviations, and (ii) the network structure itself determines the coalitions that may form. We show that if players can jointly deviate only if they form a clique in the network, then the degree of inequality that can be sustained depends on the cardinality of the maximum independent set. For bipartite networks, the size of the maximum independent set fully characterizes the degree of inequality that can be sustained. This result extends partially to general networks and to the case in which a group of players can deviate jointly if they are all sufficiently close to each other in the network.
► This paper studies how the structure of a social network constrains the level of inequality that can be sustained. ► If a group of players in a network can deviate only when they are directly connected, a key determinant is the size of the maximum independent set of the network. ► In bipartite networks, the size of the maximum independent set fully characterizes the maximum level of inequality that can be sustained. ► A partial characterization is provided for general networks.</description><identifier>ISSN: 0899-8256</identifier><identifier>EISSN: 1090-2473</identifier><identifier>DOI: 10.1016/j.geb.2010.12.007</identifier><language>eng</language><publisher>Duluth: Elsevier Inc</publisher><subject>Coalitions ; Cooperation ; Cooperative games ; Equilibrium models ; Equilibrium theory ; Game theory ; Games of strategy ; Inequality ; Inequality Networks Cooperative games Lorenz dominance ; Lorenz dominance ; Mathematical economics ; Networks ; Social networks ; Studies</subject><ispartof>Games and economic behavior, 2011-09, Vol.73 (1), p.215-226</ispartof><rights>2011 Elsevier Inc.</rights><rights>Copyright Academic Press Sep 2011</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c529t-5b6492d12e453f36f15071673f60caa1f548e8b1a7df145ae8c47e7eb2b32bd3</citedby><cites>FETCH-LOGICAL-c529t-5b6492d12e453f36f15071673f60caa1f548e8b1a7df145ae8c47e7eb2b32bd3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0899825611000029$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,3994,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeegamebe/v_3a73_3ay_3a2011_3ai_3a1_3ap_3a215-226.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Kets, Willemien</creatorcontrib><creatorcontrib>Iyengar, Garud</creatorcontrib><creatorcontrib>Sethi, Rajiv</creatorcontrib><creatorcontrib>Bowles, Samuel</creatorcontrib><title>Inequality and network structure</title><title>Games and economic behavior</title><description>We explore the manner in which the structure of a social network constrains the level of inequality that can be sustained among its members, based on the following considerations: (i) any distribution of value must be stable with respect to coalitional deviations, and (ii) the network structure itself determines the coalitions that may form. We show that if players can jointly deviate only if they form a clique in the network, then the degree of inequality that can be sustained depends on the cardinality of the maximum independent set. For bipartite networks, the size of the maximum independent set fully characterizes the degree of inequality that can be sustained. This result extends partially to general networks and to the case in which a group of players can deviate jointly if they are all sufficiently close to each other in the network.
► This paper studies how the structure of a social network constrains the level of inequality that can be sustained. ► If a group of players in a network can deviate only when they are directly connected, a key determinant is the size of the maximum independent set of the network. ► In bipartite networks, the size of the maximum independent set fully characterizes the maximum level of inequality that can be sustained. ► A partial characterization is provided for general networks.</description><subject>Coalitions</subject><subject>Cooperation</subject><subject>Cooperative games</subject><subject>Equilibrium models</subject><subject>Equilibrium theory</subject><subject>Game theory</subject><subject>Games of strategy</subject><subject>Inequality</subject><subject>Inequality Networks Cooperative games Lorenz dominance</subject><subject>Lorenz dominance</subject><subject>Mathematical economics</subject><subject>Networks</subject><subject>Social networks</subject><subject>Studies</subject><issn>0899-8256</issn><issn>1090-2473</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNp9kEtPwzAQhC0EEuXxA7hVXDileP2IHXFCFY-iSlx6txxnUxLapLWTov57HAVx4MBhPVprZrT6CLkBOgMK6X09W2M-Y3TY2YxSdUImQDOaMKH4KZlQnWWJZjI9Jxch1JRSyRSdkOmiwX1vN1V3nNqmmDbYfbX-cxo637uu93hFzkq7CXj9o5dk9fy0mr8my_eXxfxxmTjJsi6ReSoyVgBDIXnJ0xIkVZAqXqbUWQulFBp1DlYVJQhpUTuhUGHOcs7ygl-Su7F259t9j6Ez2yo43Gxsg20fjNZCCwYaovP2j7Nue9_E26KJZ5AKNZhgNDnfhuCxNDtfba0_GqBmAGZqE4GZAZgBZiKwmHkbMx536H4DiLi2W8zRHAy3isfnGCcmIUoVZ9Dd8AXSMJaaj24byx7GMozMDhV6E1yFjcOi8ug6U7TVP6d8A0Ftii4</recordid><startdate>20110901</startdate><enddate>20110901</enddate><creator>Kets, Willemien</creator><creator>Iyengar, Garud</creator><creator>Sethi, Rajiv</creator><creator>Bowles, Samuel</creator><general>Elsevier Inc</general><general>Elsevier</general><general>Academic Press</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8BJ</scope><scope>FQK</scope><scope>JBE</scope></search><sort><creationdate>20110901</creationdate><title>Inequality and network structure</title><author>Kets, Willemien ; Iyengar, Garud ; Sethi, Rajiv ; Bowles, Samuel</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c529t-5b6492d12e453f36f15071673f60caa1f548e8b1a7df145ae8c47e7eb2b32bd3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Coalitions</topic><topic>Cooperation</topic><topic>Cooperative games</topic><topic>Equilibrium models</topic><topic>Equilibrium theory</topic><topic>Game theory</topic><topic>Games of strategy</topic><topic>Inequality</topic><topic>Inequality Networks Cooperative games Lorenz dominance</topic><topic>Lorenz dominance</topic><topic>Mathematical economics</topic><topic>Networks</topic><topic>Social networks</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kets, Willemien</creatorcontrib><creatorcontrib>Iyengar, Garud</creatorcontrib><creatorcontrib>Sethi, Rajiv</creatorcontrib><creatorcontrib>Bowles, Samuel</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>International Bibliography of the Social Sciences (IBSS)</collection><collection>International Bibliography of the Social Sciences</collection><collection>International Bibliography of the Social Sciences</collection><jtitle>Games and economic behavior</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kets, Willemien</au><au>Iyengar, Garud</au><au>Sethi, Rajiv</au><au>Bowles, Samuel</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Inequality and network structure</atitle><jtitle>Games and economic behavior</jtitle><date>2011-09-01</date><risdate>2011</risdate><volume>73</volume><issue>1</issue><spage>215</spage><epage>226</epage><pages>215-226</pages><issn>0899-8256</issn><eissn>1090-2473</eissn><abstract>We explore the manner in which the structure of a social network constrains the level of inequality that can be sustained among its members, based on the following considerations: (i) any distribution of value must be stable with respect to coalitional deviations, and (ii) the network structure itself determines the coalitions that may form. We show that if players can jointly deviate only if they form a clique in the network, then the degree of inequality that can be sustained depends on the cardinality of the maximum independent set. For bipartite networks, the size of the maximum independent set fully characterizes the degree of inequality that can be sustained. This result extends partially to general networks and to the case in which a group of players can deviate jointly if they are all sufficiently close to each other in the network.
► This paper studies how the structure of a social network constrains the level of inequality that can be sustained. ► If a group of players in a network can deviate only when they are directly connected, a key determinant is the size of the maximum independent set of the network. ► In bipartite networks, the size of the maximum independent set fully characterizes the maximum level of inequality that can be sustained. ► A partial characterization is provided for general networks.</abstract><cop>Duluth</cop><pub>Elsevier Inc</pub><doi>10.1016/j.geb.2010.12.007</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0899-8256 |
ispartof | Games and economic behavior, 2011-09, Vol.73 (1), p.215-226 |
issn | 0899-8256 1090-2473 |
language | eng |
recordid | cdi_proquest_miscellaneous_884842181 |
source | RePEc; Elsevier ScienceDirect Journals Complete |
subjects | Coalitions Cooperation Cooperative games Equilibrium models Equilibrium theory Game theory Games of strategy Inequality Inequality Networks Cooperative games Lorenz dominance Lorenz dominance Mathematical economics Networks Social networks Studies |
title | Inequality and network structure |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T15%3A12%3A45IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Inequality%20and%20network%20structure&rft.jtitle=Games%20and%20economic%20behavior&rft.au=Kets,%20Willemien&rft.date=2011-09-01&rft.volume=73&rft.issue=1&rft.spage=215&rft.epage=226&rft.pages=215-226&rft.issn=0899-8256&rft.eissn=1090-2473&rft_id=info:doi/10.1016/j.geb.2010.12.007&rft_dat=%3Cproquest_cross%3E2427560311%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=883916471&rft_id=info:pmid/&rft_els_id=S0899825611000029&rfr_iscdi=true |