1. The evolution of fairness under an assortative matching rule in the ultimatum game

   • Yasuhiro Shirata

   OriginalPaper 26 January 2011 Pages: 1 - 21

2. Finitely repeated prisoners’ dilemma experiments without a commonly known end

   • Lisa V. Bruttel
   • Werner Güth
   • Ulrich Kamecke

   OriginalPaper 26 March 2011 Pages: 23 - 47

3. Bidding and sequential coalition formation with externalities

   • Licun Xue
   • Lingling Zhang

   OriginalPaper 23 March 2011 Pages: 49 - 73

4. Computing solutions for matching games

   • Péter Biró
   • Walter Kern
   • Daniël Paulusma

   OriginalPaper 27 March 2011 Pages: 75 - 90

5. Choosing fair lotteries to defeat the competition

   • Liad Wagman
   • Vincent Conitzer

   OriginalPaper 03 April 2011 Pages: 91 - 129

6. Generalized solution concepts in games with possibly unaware players

   • Leandro C. Rêgo
   • Joseph Y. Halpern

   OriginalPaper 21 April 2011 Pages: 131 - 155

7. Compensations in the Shapley value and the compensation solutions for graph games

   • Sylvain Béal
   • Eric Rémila
   • Philippe Solal

   OriginalPaper 07 April 2011 Pages: 157 - 178

8. A further note on the college admission game

   • Marilda Sotomayor

   OriginalPaper 07 April 2011 Pages: 179 - 193

9. The value of two-person zero-sum repeated games with incomplete information and uncertain duration

   • Abraham Neyman

   OriginalPaper 23 June 2011 Pages: 195 - 207

10. The Walrasian output beats the market

    • Antonio J. Morales
    • Gonzalo Fernández-de-Córdoba

    Original Paper 05 January 2011 Pages: 209 - 212

11. Y. Narahari, D. Garg, R. Narayanam and H. Prakash: Game theoretic problems in network economics and mechanism design solutions

    • Omkar D. Palsule-Desai

    Book Review 21 June 2011 Pages: 213 - 217