<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns="http://purl.org/rss/1.0/"
    xmlns:cc="http://web.resource.org/cc/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<channel rdf:about="http://www.mdpi.com/rss/special_issue/coalition-form">
		<title>Games: Coalition Formation</title>
		<link>http://www.mdpi.com/journal/games/special_issues/coalition-form/</link>
		<description>Dear Colleagues,
Since the earliest days of mankind we have realized that there are gains from cooperating with others. As a consequence our socio-economic environment abounds with group structures like families, clubs, firms, political interest groups, military alliances and all kinds of international organizations and agreements. While the early literature in cooperative game theory has taken the coalition structure as exogenously given and has focused on the question of how the gains from cooperation are distributed among the members of a coalition, the theory of coalition formation deals with the emergence and stability of coalitions among individual decision makers. The problem of coalition formation becomes very complex if coalitions impose externalities on each other and if multiple memberships are allowed. For the Special Issue in Games I invite original contributions on coalition formation (including matching problems) from cooperative and non-cooperative game theory as well as from experimental economics. General and applied contributions, e.g. dealing with international environmental agreements, are equally welcome.
Prof. Dr. Anke Gerber 
Guest Editor
Submission Information
All manuscripts should be submitted to games@mdpi.com  with a copy to the Guest Editor. Manuscripts can be submitted until the  deadline. Papers will be published continuously (as soon as accepted)  and will be listed together on the special issue website. Research  articles, review articles as well as communications are invited. For  planned papers, a title and short abstract (about 100 words) can be sent  to the Editorial Office for announcement on this website. 

Submitted manuscripts should not have been published previously, nor be  under consideration for publication elsewhere (except conference  proceedings papers). All manuscripts are refereed through a peer-review  process. A guide for authors and other relevant information for  submission of manuscripts is available on the Instructions  for Authors page. Games is an international peer-reviewed Open Access  quarterly journal published by MDPI.  

Please visit the Instructions  for Authors page before submitting a  manuscript. For the first couple of issues, to be published in 2010, the Article Processing Charges    (APC) will be waived for well-prepared manuscripts. English  correction   and/or formatting fees of 250 CHF (Swiss Francs) will be  charged in   certain cases for those articles accepted for publication  that require   extensive additional formatting and/or English  corrections.</description>
								<items>
			<rdf:Seq>
							<rdf:li rdf:resource="http://www.mdpi.com/2073-4336/1/3/338/" />
            				<rdf:li rdf:resource="http://www.mdpi.com/2073-4336/1/3/299/" />
            				<rdf:li rdf:resource="http://www.mdpi.com/2073-4336/1/3/286/" />
            				<rdf:li rdf:resource="http://www.mdpi.com/2073-4336/1/2/159/" />
            				<rdf:li rdf:resource="http://www.mdpi.com/2073-4336/1/2/137/" />
            				<rdf:li rdf:resource="http://www.mdpi.com/2073-4336/1/2/66/" />
                    	</rdf:Seq>
		</items>
				<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
	</channel>
	<item rdf:about="http://www.mdpi.com/2073-4336/1/3/338/">
	<title>Games, Vol. 1, Pages 338-356: Partial Cooperative Equilibria: Existence and Characterization</title>
	<link>http://www.mdpi.com/2073-4336/1/3/338/</link>
	<description>We study the solution concepts of partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria. The partial cooperative Cournot-Nash equilibrium is axiomatically characterized by using notions of rationality, consistency and converse consistency with regard to reduced games. We also establish sufficient conditions for which partial cooperative Cournot-Nash equilibria and partial cooperative Stackelberg equilibria exist in supermodular games. Finally, we provide an application to strategic network formation where such solution concepts may be useful.</description>
	
	<guid>http://www.mdpi.com/2073-4336/1/3/338/</guid>
	<pubDate>Tue, 21 Sep 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Games</prism:publicationName>
	<prism:publicationDate>2010-09-21</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>338</prism:startingPage>
		<prism:endingPage>356</prism:endingPage>
		<prism:issn>2073-4336</prism:issn>
	
	<dc:title>Partial Cooperative Equilibria: Existence and Characterization</dc:title>
	<dc:date>2010-09-21</dc:date>
	<dc:identifier>doi: 10.3390/g1030338</dc:identifier>
		<dc:creator>Sylvain Béal</dc:creator>
		<dc:creator>Subhadip Chakrabarti</dc:creator>
		<dc:creator>Amandine Ghintran</dc:creator>
		<dc:creator>Philippe Solal</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>
	<item rdf:about="http://www.mdpi.com/2073-4336/1/3/299/">
	<title>Games, Vol. 1, Pages 299-316: Universally Balanced Combinatorial Optimization Games</title>
	<link>http://www.mdpi.com/2073-4336/1/3/299/</link>
	<description>This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to integer constraints. In economic settings, the integer requirement reflects some forms of indivisibility. We are interested in the classes of games that guarantee a non-empty core no matter what are the admissible values assigned to the parameters defining these programs. We call such classes universally balanced. We present characterization and complexity results on the universally balancedness property for some classes of interesting combinatorial optimization games. In particular, we focus on the algorithmic properties for identifying universally balancedness for the games under discussion.</description>
	
	<guid>http://www.mdpi.com/2073-4336/1/3/299/</guid>
	<pubDate>Mon, 13 Sep 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Games</prism:publicationName>
	<prism:publicationDate>2010-09-13</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>299</prism:startingPage>
		<prism:endingPage>316</prism:endingPage>
		<prism:issn>2073-4336</prism:issn>
	
	<dc:title>Universally Balanced Combinatorial Optimization Games</dc:title>
	<dc:date>2010-09-13</dc:date>
	<dc:identifier>doi: 10.3390/g1030299</dc:identifier>
		<dc:creator>Gabrielle Demange</dc:creator>
		<dc:creator>Xiaotie Deng</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>
	<item rdf:about="http://www.mdpi.com/2073-4336/1/3/286/">
	<title>Games, Vol. 1, Pages 286-298: Coalition Formation among Farsighted Agents</title>
	<link>http://www.mdpi.com/2073-4336/1/3/286/</link>
	<description>A set of coalition structures P is farsightedly stable (i) if all possible deviations from any coalition structure p belonging to P to a coalition structure outside P are deterred by the threat of ending worse off or equally well off, (ii) if there exists a farsighted improvingpath from any coalition structure outside the set leading to some coalition structure in the set, and (iii) if there is no proper subset of P satisfying the first two conditions. A non-empty farsightedly stable set always exists. We provide a characterization of unique farsightedly stable sets of coalition structures and we study the relationship between farsighted stability and other concepts such as the largest consistent set and the von Neumann-Morgenstern farsightedly stable set. Finally, we illustrate our results by means of coalition formation games with positive spillovers.</description>
	
	<guid>http://www.mdpi.com/2073-4336/1/3/286/</guid>
	<pubDate>Thu, 02 Sep 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Games</prism:publicationName>
	<prism:publicationDate>2010-09-02</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>3</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>286</prism:startingPage>
		<prism:endingPage>298</prism:endingPage>
		<prism:issn>2073-4336</prism:issn>
	
	<dc:title>Coalition Formation among Farsighted Agents</dc:title>
	<dc:date>2010-09-02</dc:date>
	<dc:identifier>doi: 10.3390/g1030286</dc:identifier>
		<dc:creator>P. Jean-Jacques Herings</dc:creator>
		<dc:creator>Ana Mauleon</dc:creator>
		<dc:creator>Vincent Vannetelbosch</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>
	<item rdf:about="http://www.mdpi.com/2073-4336/1/2/159/">
	<title>Games, Vol. 1, Pages 159-167: Balanced Weights and Three-Sided Coalition Formation</title>
	<link>http://www.mdpi.com/2073-4336/1/2/159/</link>
	<description>We consider three-sided coalition formation problems when each agent is concerned about his local status as measured by his relative rank position within the group of his own type and about his global status as measured by the weighted sum of the average rankings of the other types of groups. We show that a core stable coalition structure always exists, provided that the corresponding weights are balanced and each agent perceives the two types of status as being substitutable.</description>
	
	<guid>http://www.mdpi.com/2073-4336/1/2/159/</guid>
	<pubDate>Fri, 25 Jun 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Games</prism:publicationName>
	<prism:publicationDate>2010-06-25</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>159</prism:startingPage>
		<prism:endingPage>167</prism:endingPage>
		<prism:issn>2073-4336</prism:issn>
	
	<dc:title>Balanced Weights and Three-Sided Coalition Formation</dc:title>
	<dc:date>2010-06-25</dc:date>
	<dc:identifier>doi: 10.3390/g1020159</dc:identifier>
		<dc:creator> Lazarova</dc:creator>
		<dc:creator> Dimitrov</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>
	<item rdf:about="http://www.mdpi.com/2073-4336/1/2/137/">
	<title>Games, Vol. 1, Pages 137-158: Can Justice and Fairness Enlarge International Environmental Agreements?</title>
	<link>http://www.mdpi.com/2073-4336/1/2/137/</link>
	<description>The literature on International Environmental Agreements (IEAs) predicts a rather low number of signatories to an IEA. This is in sharp contrast to empirical evidence. As experimental economics provides some evidence for more complex human behavior, extending the theory of IEAs to a broader class of preferences is clearly promising. The present paper shows that where countries’ preferences incorporate justice and fairness there will be a strong incentive for them to choose similar abatement policies within and outside an IEA. Consequently, free-riding at the expense of the signatory states diminishes and participation in an IEA becomes a more successful strategy, so that the size of stable IEAs increases.</description>
	
	<guid>http://www.mdpi.com/2073-4336/1/2/137/</guid>
	<pubDate>Thu, 24 Jun 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Games</prism:publicationName>
	<prism:publicationDate>2010-06-24</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>137</prism:startingPage>
		<prism:endingPage>158</prism:endingPage>
		<prism:issn>2073-4336</prism:issn>
	
	<dc:title>Can Justice and Fairness Enlarge International Environmental Agreements?</dc:title>
	<dc:date>2010-06-24</dc:date>
	<dc:identifier>doi: 10.3390/g1020137</dc:identifier>
		<dc:creator> Grüning</dc:creator>
		<dc:creator> Peters</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>
	<item rdf:about="http://www.mdpi.com/2073-4336/1/2/66/">
	<title>Games, Vol. 1, Pages 66-88: The Recursive Core for Non-Superadditive Games</title>
	<link>http://www.mdpi.com/2073-4336/1/2/66/</link>
	<description>We study the recursive core introduced in Huang and Sjöström [8]. In general partition function form games, the recursive core coalition structure may be either coarser or finer than the one that maximizes the social surplus. Moreover, the recursive core structure is typically different from the one predicted by the α-core. We fully implement the recursive core for general games, including non-superadditive games where the grand coalition does not form in equilibrium. We do not put any restrictions, such as stationarity, on strategies.</description>
	
	<guid>http://www.mdpi.com/2073-4336/1/2/66/</guid>
	<pubDate>Thu, 15 Apr 2010 00:00:00 CEST</pubDate>
	
	<prism:publicationName>Games</prism:publicationName>
	<prism:publicationDate>2010-04-15</prism:publicationDate>
	<prism:volume>1</prism:volume>
	<prism:number>2</prism:number>
	<prism:section>Article</prism:section>
	<prism:startingPage>66</prism:startingPage>
		<prism:endingPage>88</prism:endingPage>
		<prism:issn>2073-4336</prism:issn>
	
	<dc:title>The Recursive Core for Non-Superadditive Games</dc:title>
	<dc:date>2010-04-15</dc:date>
	<dc:identifier>doi: 10.3390/g1020066</dc:identifier>
		<dc:creator> Huang</dc:creator>
		<dc:creator> Sjöström</dc:creator>
	
	<cc:license rdf:resource="http://creativecommons.org/licenses/by/3.0/" />
</item>


<cc:License rdf:about="http://creativecommons.org/licenses/by/3.0/">
	<cc:permits rdf:resource="http://creativecommons.org/ns#Reproduction" />
	<cc:permits rdf:resource="http://creativecommons.org/ns#Distribution" />
	<cc:permits rdf:resource="http://creativecommons.org/ns#DerivativeWorks" />
</cc:License>

</rdf:RDF>
