An Axiomatization of the Disjunctive Permission Value for Games with a Permission Structure
Author
Abstract
Suggested Citation
Note: Received May 1994 Revised version January 1995
Download full text from publisher
To our knowledge, this item is not available for download. To find whether it is available, there are three options:1. Check below whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- René Brink & Frank Steffen, 2012.
"Axiomatizations of a positional power score and measure for hierarchies,"
Public Choice, Springer, vol. 151(3), pages 757-787, June.
- René van den Brink & Frank Steffen, 2008. "Axiomatizations of a Positional Power Score and Measure for Hierarchies," Tinbergen Institute Discussion Papers 08-115/1, Tinbergen Institute.
- René Brink & Pieter Ruys, 2008.
"Technology driven organizational structure of the firm,"
Annals of Finance, Springer, vol. 4(4), pages 481-503, October.
- van den Brink, J.R. & Ruys, P.H.M., 2008. "Technology driven organizational structure of the firm," Other publications TiSEM 417827ae-0c53-4d1e-8f55-1, Tilburg University, School of Economics and Management.
- René Brink & Ilya Katsev & Gerard Laan, 2011.
"Axiomatizations of two types of Shapley values for games on union closed systems,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 47(1), pages 175-188, May.
- Rene van den Brink & Ilya Katsev & Gerard van der Laan, 2009. "Axiomatizations of Two Types of Shapley Values for Games on Union Closed Systems," Tinbergen Institute Discussion Papers 09-064/1, Tinbergen Institute.
- Lei Li & Xueliang Li, 2011. "The covering values for acyclic digraph games," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(4), pages 697-718, November.
- René Brink & Ilya Katsev & Gerard Laan, 2011. "A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(3), pages 591-616, August.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jogath:v:26:y:1997:i:1:p:27-43. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.