A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure
Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many such allocation problems there is some hierarchical ordering of the players. In this paper we consider a class of games with a permission structure describing situations in which players...
Gespeichert in:
| Veröffentlicht in: | International journal of game theory 2011-08, Vol.40 (3), p.591-616 |
|---|---|
| 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 | 616 |
|---|---|
| container_issue | 3 |
| container_start_page | 591 |
| container_title | International journal of game theory |
| container_volume | 40 |
| creator | van den Brink, René Katsev, Ilya van der Laan, Gerard |
| description | Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many such allocation problems there is some hierarchical ordering of the players. In this paper we consider a class of
games with a permission structure
describing situations in which players in a cooperative TU-game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. The corresponding restricted game takes account of the limited cooperation possibilities by assigning to every coalition the worth of its largest feasible subset. In this paper we provide a polynomial time algorithm for computing the
nucleolus
of the restricted games corresponding to a class of games with a permission structure which economic applications include auction games, dual airport games, dual polluted river games and information market games. |
| doi_str_mv | 10.1007/s00182-010-0257-3 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1468360020</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1468360020</sourcerecordid><originalsourceid>FETCH-LOGICAL-c423t-c30d57db50f691fbd2be4c4ae43211882ad0018b504966a1d262ca303cf78ac53</originalsourceid><addsrcrecordid>eNp1kU9LAzEQxYMoWKsfwFvw5GV1kmx3t8dS_AcFL3oOaTbbpmQ3ayZR_PamVhAET3N4v_eYmUfIJYMbBlDfIgBreAEMCuCzuhBHZMJKwQvGazgmEwAORc3r6pScIe4ge6DhExIXdPTuc_C9VY5G2xuq3MYHG7c97Xyg2vdjinbY0Lg1dEjaGe8SfmuKaqcQqe9oa3GXBh3tu6Eb1RukHzkiE6MJvUW0fqAYQ9IxBXNOTjrl0Fz8zCl5vb97WT4Wq-eHp-ViVeiSi1hoAe2sbtcz6Ko569YtX5tSl8rkuxhrGq7a_dVZL-dVpVjLK66VAKG7ulF6Jqbk-pA7Bv-WDEaZV9HGOTUYn1CysmpEtX9NRq_-oDufwpC3k00D81JAyTLEDpAOHjGYTo7B9ip8SgZyX4M81CBzDXJfgxTZww8ezOywMeE3-H_TF4Vdi4E</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>880943041</pqid></control><display><type>article</type><title>A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure</title><source>EBSCOhost Business Source Complete</source><source>SpringerLink Journals - AutoHoldings</source><creator>van den Brink, René ; Katsev, Ilya ; van der Laan, Gerard</creator><creatorcontrib>van den Brink, René ; Katsev, Ilya ; van der Laan, Gerard</creatorcontrib><description>Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many such allocation problems there is some hierarchical ordering of the players. In this paper we consider a class of
games with a permission structure
describing situations in which players in a cooperative TU-game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. The corresponding restricted game takes account of the limited cooperation possibilities by assigning to every coalition the worth of its largest feasible subset. In this paper we provide a polynomial time algorithm for computing the
nucleolus
of the restricted games corresponding to a class of games with a permission structure which economic applications include auction games, dual airport games, dual polluted river games and information market games.</description><identifier>ISSN: 0020-7276</identifier><identifier>EISSN: 1432-1270</identifier><identifier>DOI: 10.1007/s00182-010-0257-3</identifier><identifier>CODEN: IJGTA2</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer-Verlag</publisher><subject>Airports ; Algorithms ; Allocations ; Behavioral/Experimental Economics ; Cooperation ; Economic Theory/Quantitative Economics/Mathematical Methods ; Economics ; Economics and Finance ; Game Theory ; Information sharing ; Operations Research/Decision Theory ; Peers ; Social and Behav. Sciences ; Studies</subject><ispartof>International journal of game theory, 2011-08, Vol.40 (3), p.591-616</ispartof><rights>The Author(s) 2010</rights><rights>Springer-Verlag 2011</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c423t-c30d57db50f691fbd2be4c4ae43211882ad0018b504966a1d262ca303cf78ac53</citedby><cites>FETCH-LOGICAL-c423t-c30d57db50f691fbd2be4c4ae43211882ad0018b504966a1d262ca303cf78ac53</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s00182-010-0257-3$$EPDF$$P50$$Gspringer$$Hfree_for_read</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s00182-010-0257-3$$EHTML$$P50$$Gspringer$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,27924,27925,41488,42557,51319</link.rule.ids></links><search><creatorcontrib>van den Brink, René</creatorcontrib><creatorcontrib>Katsev, Ilya</creatorcontrib><creatorcontrib>van der Laan, Gerard</creatorcontrib><title>A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure</title><title>International journal of game theory</title><addtitle>Int J Game Theory</addtitle><description>Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many such allocation problems there is some hierarchical ordering of the players. In this paper we consider a class of
games with a permission structure
describing situations in which players in a cooperative TU-game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. The corresponding restricted game takes account of the limited cooperation possibilities by assigning to every coalition the worth of its largest feasible subset. In this paper we provide a polynomial time algorithm for computing the
nucleolus
of the restricted games corresponding to a class of games with a permission structure which economic applications include auction games, dual airport games, dual polluted river games and information market games.</description><subject>Airports</subject><subject>Algorithms</subject><subject>Allocations</subject><subject>Behavioral/Experimental Economics</subject><subject>Cooperation</subject><subject>Economic Theory/Quantitative Economics/Mathematical Methods</subject><subject>Economics</subject><subject>Economics and Finance</subject><subject>Game Theory</subject><subject>Information sharing</subject><subject>Operations Research/Decision Theory</subject><subject>Peers</subject><subject>Social and Behav. Sciences</subject><subject>Studies</subject><issn>0020-7276</issn><issn>1432-1270</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>C6C</sourceid><sourceid>8G5</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNp1kU9LAzEQxYMoWKsfwFvw5GV1kmx3t8dS_AcFL3oOaTbbpmQ3ayZR_PamVhAET3N4v_eYmUfIJYMbBlDfIgBreAEMCuCzuhBHZMJKwQvGazgmEwAORc3r6pScIe4ge6DhExIXdPTuc_C9VY5G2xuq3MYHG7c97Xyg2vdjinbY0Lg1dEjaGe8SfmuKaqcQqe9oa3GXBh3tu6Eb1RukHzkiE6MJvUW0fqAYQ9IxBXNOTjrl0Fz8zCl5vb97WT4Wq-eHp-ViVeiSi1hoAe2sbtcz6Ko569YtX5tSl8rkuxhrGq7a_dVZL-dVpVjLK66VAKG7ulF6Jqbk-pA7Bv-WDEaZV9HGOTUYn1CysmpEtX9NRq_-oDufwpC3k00D81JAyTLEDpAOHjGYTo7B9ip8SgZyX4M81CBzDXJfgxTZww8ezOywMeE3-H_TF4Vdi4E</recordid><startdate>20110801</startdate><enddate>20110801</enddate><creator>van den Brink, René</creator><creator>Katsev, Ilya</creator><creator>van der Laan, Gerard</creator><general>Springer-Verlag</general><general>Springer Nature B.V</general><scope>C6C</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AO</scope><scope>8BJ</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FQK</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JBE</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>M0C</scope><scope>M2O</scope><scope>M2P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PADUT</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>PYYUZ</scope><scope>Q9U</scope><scope>7TM</scope></search><sort><creationdate>20110801</creationdate><title>A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure</title><author>van den Brink, René ; Katsev, Ilya ; van der Laan, Gerard</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c423t-c30d57db50f691fbd2be4c4ae43211882ad0018b504966a1d262ca303cf78ac53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Airports</topic><topic>Algorithms</topic><topic>Allocations</topic><topic>Behavioral/Experimental Economics</topic><topic>Cooperation</topic><topic>Economic Theory/Quantitative Economics/Mathematical Methods</topic><topic>Economics</topic><topic>Economics and Finance</topic><topic>Game Theory</topic><topic>Information sharing</topic><topic>Operations Research/Decision Theory</topic><topic>Peers</topic><topic>Social and Behav. Sciences</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>van den Brink, René</creatorcontrib><creatorcontrib>Katsev, Ilya</creatorcontrib><creatorcontrib>van der Laan, Gerard</creatorcontrib><collection>Springer Nature OA Free Journals</collection><collection>CrossRef</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>International Bibliography of the Social Sciences (IBSS)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>International Bibliography of the Social Sciences</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>International Bibliography of the Social Sciences</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Research Library China</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><collection>Nucleic Acids Abstracts</collection><jtitle>International journal of game theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>van den Brink, René</au><au>Katsev, Ilya</au><au>van der Laan, Gerard</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure</atitle><jtitle>International journal of game theory</jtitle><stitle>Int J Game Theory</stitle><date>2011-08-01</date><risdate>2011</risdate><volume>40</volume><issue>3</issue><spage>591</spage><epage>616</epage><pages>591-616</pages><issn>0020-7276</issn><eissn>1432-1270</eissn><coden>IJGTA2</coden><abstract>Recently, applications of cooperative game theory to economic allocation problems have gained popularity. In many such allocation problems there is some hierarchical ordering of the players. In this paper we consider a class of
games with a permission structure
describing situations in which players in a cooperative TU-game are hierarchically ordered in the sense that there are players that need permission from other players before they are allowed to cooperate. The corresponding restricted game takes account of the limited cooperation possibilities by assigning to every coalition the worth of its largest feasible subset. In this paper we provide a polynomial time algorithm for computing the
nucleolus
of the restricted games corresponding to a class of games with a permission structure which economic applications include auction games, dual airport games, dual polluted river games and information market games.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer-Verlag</pub><doi>10.1007/s00182-010-0257-3</doi><tpages>26</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-7276 |
| ispartof | International journal of game theory, 2011-08, Vol.40 (3), p.591-616 |
| issn | 0020-7276 1432-1270 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1468360020 |
| source | EBSCOhost Business Source Complete; SpringerLink Journals - AutoHoldings |
| subjects | Airports Algorithms Allocations Behavioral/Experimental Economics Cooperation Economic Theory/Quantitative Economics/Mathematical Methods Economics Economics and Finance Game Theory Information sharing Operations Research/Decision Theory Peers Social and Behav. Sciences Studies |
| title | A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-07T09%3A57%3A14IST&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=A%20polynomial%20time%20algorithm%20for%20computing%20the%20nucleolus%20for%20a%20class%20of%20disjunctive%20games%20with%20a%20permission%20structure&rft.jtitle=International%20journal%20of%20game%20theory&rft.au=van%20den%20Brink,%20Ren%C3%A9&rft.date=2011-08-01&rft.volume=40&rft.issue=3&rft.spage=591&rft.epage=616&rft.pages=591-616&rft.issn=0020-7276&rft.eissn=1432-1270&rft.coden=IJGTA2&rft_id=info:doi/10.1007/s00182-010-0257-3&rft_dat=%3Cproquest_cross%3E1468360020%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=880943041&rft_id=info:pmid/&rfr_iscdi=true |