IDEAS home Printed from https://ideas.repec.org/a/kap/theord/v56y2004i2_2p205-213.html
   My bibliography  Save this article

A Note On The Owen Set Of Linear

Author

Listed:
  • Vito Fragnelli

Abstract

No abstract is available for this item.

Suggested Citation

  • Vito Fragnelli, 2004. "A Note On The Owen Set Of Linear," Theory and Decision, Springer, vol. 56(2_2), pages 205-213, February.
  • Handle: RePEc:kap:theord:v:56:y:2004:i:2_2:p:205-213
    as

    Download full text from publisher

    File URL: http://journals.kluweronline.com/issn/0040-5833/contents
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Ehud Kalai & Eitan Zemel, 1982. "Totally Balanced Games and Games of Flow," Mathematics of Operations Research, INFORMS, vol. 7(3), pages 476-478, August.
    2. Dov Samet & Eitan Zemel, 1984. "On the Core and Dual Set of Linear Programming Games," Mathematics of Operations Research, INFORMS, vol. 9(2), pages 309-316, May.
    3. Feltkamp, V. & Tijs, S.H. & Muto, S., 1994. "Bird's tree allocations revisited," Discussion Paper 1994-35, Tilburg University, Center for Economic Research.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vito Fragnelli & Gianfranco Gambarelli, 2014. "Further open problems in cooperative games," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 24(4), pages 51-62.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ichiro Nishizaki & Tomohiro Hayashida & Yuki Shintomi, 2016. "A core-allocation for a network restricted linear production game," Annals of Operations Research, Springer, vol. 238(1), pages 389-410, March.
    2. Ichiro Nishizaki & Tomohiro Hayashida & Shinya Sekizaki & Kojiro Furumi, 2023. "A two-stage linear production planning model with partial cooperation under stochastic demands," Annals of Operations Research, Springer, vol. 320(1), pages 293-324, January.
    3. Ichiro Nishizaki & Tomohiro Hayashida & Shinya Sekizaki & Kenta Tanaka, 2023. "Averaged dual solution for linear production games and its characterization," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 31(2), pages 523-555, June.
    4. Ichiro Nishizaki & Tomohiro Hayashida & Yuki Shintomi, 2016. "A core-allocation for a network restricted linear production game," Annals of Operations Research, Springer, vol. 238(1), pages 389-410, March.
    5. Peter Borm & Herbert Hamers & Ruud Hendrickx, 2001. "Operations research games: A survey," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 9(2), pages 139-199, December.
    6. Sanchez-Soriano, Joaquin, 2006. "Pairwise solutions and the core of transportation situations," European Journal of Operational Research, Elsevier, vol. 175(1), pages 101-110, November.
    7. Csóka Péter & Pintér Miklós, 2016. "On the Impossibility of Fair Risk Allocation," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 16(1), pages 143-158, January.
    8. Streekstra, Leanne & Trudeau, Christian, 2020. "Stable source connection and assignment problems as multi-period shortest path problems," Discussion Papers on Economics 7/2020, University of Southern Denmark, Department of Economics.
    9. Luyi Gui & Atalay Atasu & Özlem Ergun & L. Beril Toktay, 2016. "Efficient Implementation of Collective Extended Producer Responsibility Legislation," Management Science, INFORMS, vol. 62(4), pages 1098-1123, April.
    10. Tijs, S.H. & Timmer, J.B. & Llorca, N. & Sánchez-Soriano, J., 2000. "The Owen Set and the Core of Semi-Infinite Linear Production Situations," Discussion Paper 2000-49, Tilburg University, Center for Economic Research.
    11. Algaba, Encarnación & Béal, Sylvain & Fragnelli, Vito & Llorca, Natividad & Sánchez-Soriano, Joaquin, 2019. "Relationship between labeled network games and other cooperative games arising from attributes situations," Economics Letters, Elsevier, vol. 185(C).
    12. Vito Fragnelli & Gianfranco Gambarelli, 2014. "Further open problems in cooperative games," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 24(4), pages 51-62.
    13. Xiaotie Deng & Toshihide Ibaraki & Hiroshi Nagamochi, 1999. "Algorithmic Aspects of the Core of Combinatorial Optimization Games," Mathematics of Operations Research, INFORMS, vol. 24(3), pages 751-766, August.
    14. Borrero, D.V. & Hinojosa, M.A. & Mármol, A.M., 2016. "DEA production games and Owen allocations," European Journal of Operational Research, Elsevier, vol. 252(3), pages 921-930.
    15. Michel Le Breton & Juan Moreno-Ternero & Alexei Savvateev & Shlomo Weber, 2013. "Stability and fairness in models with a multiple membership," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 673-694, August.
    16. Potters, Jos & Reijnierse, Hans & Biswas, Amit, 2006. "The nucleolus of balanced simple flow networks," Games and Economic Behavior, Elsevier, vol. 54(1), pages 205-225, January.
    17. Daniel Granot & Jeroen Kuipers & Sunil Chopra, 2002. "Cost Allocation for a Tree Network with Heterogeneous Customers," Mathematics of Operations Research, INFORMS, vol. 27(4), pages 647-661, November.
    18. Dylan Laplace Mermoud, 2023. "Geometry of Set Functions in Game Theory: Combinatorial and Computational Aspects," Papers 2301.02950, arXiv.org, revised Oct 2023.
    19. Béal, Sylvain & Ferrières, Sylvain & Rémila, Eric & Solal, Philippe, 2016. "Axiomatic characterizations under players nullification," Mathematical Social Sciences, Elsevier, vol. 80(C), pages 47-57.
    20. Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 193-236, January.

    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:kap:theord:v:56:y:2004:i:2_2:p:205-213. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.