✦ LIBER ✦

Computational Complexity of a Solution for Directed Graph Cooperative Games

✍ Scribed by Igarashi, Ayumi; Yamamoto, Yoshitsugu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Accessibility measures to nodes of direc

✍ Rafael Amer; José Miguel Giménez; Antonio Magaña 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 335 KB

Computational complexity of computing a

✍ Takayuki Nagoya; Seinosuke Toda 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 585 KB

Continuity properties of solution concep

✍ R. Lucchetti; F. Patrone; S. H. Tijs; A. Torre 📂 Article 📅 1987 🏛 Springer 🌐 German ⚖ 539 KB

A strategic implementation of the Averag

✍ van den Brink, René; van der Laan, Gerard; Moes, Nigel 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Analytic solution for the nucleolus of a

✍ Mingming Leng; Mahmut Parlar 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 78 KB

On the existence of a cooperative soluti

✍ Carsten Helm 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 78 KB