Information Market Games
Download full text from publisherTo 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.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Pierre Dehez & Sophie Poukens, 2013.
"The Shapley value as a guide to FRAND licensing agreements,"
Working Papers of BETA
2013-03, Bureau d'Economie Théorique et Appliquée, UDS, Strasbourg.
- DEHEZ, Pierre & POUKENS, SOPHIE, 2013. "The Shapley value as a guide to FRAND licensing agreements," CORE Discussion Papers 2013012, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Stef Tijs & Gert-Jan Otten, 1993. "Compromise values in cooperative game theory," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 1(1), pages 1-36, December.
- Arin, J. & Feltkamp, V., 2012. "Coalitional games: Monotonicity and core," European Journal of Operational Research, Elsevier, vol. 216(1), pages 208-213.
- Beth Allen, 2006. "Market games with asymmetric information: the core," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 29(2), pages 465-487, October.
- René van den Brink & Ilya Katsev & Gerard van der Laan, 2008. "An Algorithm for Computing the Nucleolus of Disjunctive Additive Games with An Acyclic Permission Structure," Tinbergen Institute Discussion Papers 08-104/1, Tinbergen Institute.
- Kishimoto, Shin & Watanabe, Naoki, 2017. "The kernel of a patent licensing game: The optimal number of licensees," Mathematical Social Sciences, Elsevier, vol. 86(C), pages 37-50.
- 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.
- van den Brink, René & Katsev, Ilya & van der Laan, Gerard, 2010. "An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure," European Journal of Operational Research, Elsevier, vol. 207(2), pages 817-826, December.
- Endre Bjørndal & Herbert Hamers & Maurice Koster, 2004. "Cost allocation in a bank ATM network," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 59(3), pages 405-418, July.
- Brânzei, R. & Tijs, S.H. & Timmer, J.B., 2000. "Cones of Games arising from Market Entry Problems," Discussion Paper 2000-44, Tilburg University, Center for Economic Research.
- repec:kap:theord:v:82:y:2017:i:4:d:10.1007_s11238-016-9583-7 is not listed on IDEAS
- Arin Aguirre, Francisco Javier & Feltkamp, Vicent & Montero García, María, 2013. "Coalitional games with veto players: Myopic and farsighted behavior," IKERLANAK Ikerlanak;2013-73, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.
- René van den Brink & Ilya Katsev & Gerard van der Laan, 2008. "Computation of the Nucleolus for a Class of Disjunctive Games with a Permission Structure," Tinbergen Institute Discussion Papers 08-060/1, Tinbergen Institute.
More about this item
StatisticsAccess and download statistics
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:18:y:1989:i:2:p:209-26. 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). General contact details of provider: http://www.springer.com .
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 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.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.