IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v18y1989i2p209-26.html
   My bibliography  Save this article

Information Market Games

Author

Listed:
  • Muto, Shigeo
  • Potters, Jos
  • Tijs, Stef

Abstract

No abstract is available for this item.

Suggested Citation

  • Muto, Shigeo & Potters, Jos & Tijs, Stef, 1989. "Information Market Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 18(2), pages 209-226.
  • Handle: RePEc:spr:jogath:v:18:y:1989:i:2:p:209-26
    as

    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.
    as


    Cited by:

    1. Dehez Pierre & Poukens Sophie, 2014. "The Shapley Value as a Guide to FRAND Licensing Agreements," Review of Law & Economics, De Gruyter, vol. 10(3), pages 1-20, November.
    2. J. Zambujal-Oliveira, 2021. "Supply Chain Innovation Research: A Conceptual Approach of Information Management with Game Theory," Group Decision and Negotiation, Springer, vol. 30(2), pages 377-394, April.
    3. 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.
    4. Brânzei, R. & Tijs, S.H. & Timmer, J.B., 2000. "Cones of Games arising from Market Entry Problems," Other publications TiSEM 806aad7a-8085-43a2-af3f-e, Tilburg University, School of Economics and Management.
    5. 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.
    6. 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.
    7. 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.
    8. Arin Aguirre, Francisco Javier & Feltkamp, Vicent & Montero García, María, 2013. "Coalitional games with veto players: Myopic and farsighted behavior," IKERLANAK http://www-fae1-eao1-ehu-, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.
    9. J. Arin & V. Feltkamp & M. Montero, 2015. "A bargaining procedure leading to the serial rule in games with veto players," Annals of Operations Research, Springer, vol. 229(1), pages 41-66, June.
    10. Alparslan Gök, S.Z. & Özcan, İ., 2023. "On big boss fuzzy interval games," European Journal of Operational Research, Elsevier, vol. 306(3), pages 1040-1046.
    11. Bjorndal, E. & Hamers, H.J.M. & Koster, M.A.L., 2003. "Cost Allocation in a Bank ATM Network," Other publications TiSEM b81bf5f2-084f-4552-9094-a, Tilburg University, School of Economics and Management.
    12. 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.
    13. Liu, Qi & Chow, Joseph Y.J., 2022. "Efficient and stable data-sharing in a public transit oligopoly as a coopetitive game," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 64-87.
    14. Arin, J. & Feltkamp, V., 2012. "Coalitional games: Monotonicity and core," European Journal of Operational Research, Elsevier, vol. 216(1), pages 208-213.
    15. 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.
    16. 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.
    17. 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.
    18. Saadia Obadi & Silvia Miquel, 2017. "Clan information market games," Theory and Decision, Springer, vol. 82(4), pages 501-517, April.
    19. 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

    Statistics

    Access and download statistics

    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:18:y:1989:i:2:p:209-26. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.