A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure

Rene van den Brink (), Ilya Katsev () and Gerard van der Laan

International Journal of Game Theory, 2011, vol. 40, issue 3, 616 pages

Keywords: TU-game; Nucleolus; Game with permission structure; Peer group game; Information market game; Algorithm; Complexity; C71 (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://hdl.handle.net/10.1007/s00182-010-0257-3 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jogath:v:40:y:2011:i:3:p:591-616

Ordering information: This journal article can be ordered from
http://www.springer. ... eory/journal/182/PS2

DOI: 10.1007/s00182-010-0257-3

Access Statistics for this article

International Journal of Game Theory is currently edited by Shmuel Zamir, Vijay Krishna and Bernhard von Stengel

More articles in International Journal of Game Theory from Springer, Game Theory Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().