Maximizing selections from the core of a cooperative game
No abstract is available for this item.
Volume (Year): 50 (2011)
Issue (Month): 1 (May)
|Contact details of provider:|| Web page: http://www.springer.com|
|Order Information:||Web: http://www.springer.com/business/operations+research/journal/10898|
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. "Population monotonic solutions on convex games," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(3), pages 327-338.
- Toru Hokari, 2000. "note: The nucleolus is not aggregate-monotonic on the domain of convex games," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(1), pages 133-137.
- David Housman & (*), Lori Clark, 1998. "Note Core and monotonic allocation methods," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(4), pages 611-616.
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: (Sonal Shukla)or (Rebekah McClure)
If references are entirely missing, you can add them using this form.