Maximizing selections from the core of a cooperative game
No abstract is available for this item.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 50 (2011)
Issue (Month): 1 (May)
|Contact details of provider:|| Web page: http://www.springer.com/business/operations+research/journal/10898|
|Order Information:||Web: http://link.springer.de/orders.htm|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Toru Hokari, 2000. "note: The nucleolus is not aggregate-monotonic on the domain of convex games," International Journal of Game Theory, Springer, vol. 29(1), pages 133-137.
- David Housman & (*), Lori Clark, 1998. "Note Core and monotonic allocation methods," International Journal of Game Theory, Springer, vol. 27(4), pages 611-616.
- Toru Hokari, 2000. "Population monotonic solutions on convex games," International Journal of Game Theory, Springer, vol. 29(3), pages 327-338.
When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:50:y:2011:i:1:p:107-118. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.