IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v54y2006i2p373-379.html
   My bibliography  Save this article

The vector lattice structure of the n-person TU games

Author

Listed:
  • Llerena, Francesc
  • Rafels, Carles

Abstract

No abstract is available for this item.

Suggested Citation

  • Llerena, Francesc & Rafels, Carles, 2006. "The vector lattice structure of the n-person TU games," Games and Economic Behavior, Elsevier, vol. 54(2), pages 373-379, February.
    • Handle: RePEc:eee:gamebe:v:54:y:2006:i:2:p:373-379
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899-8256(04)00202-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

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

    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. Curiel, I. & Tijs, S.H., 1991. "Minimarg and the maximarg operators," Other publications TiSEM 1f024ef6-4383-41ae-aba6-0, Tilburg University, School of Economics and Management.
    3. Jean Derks & Hans Haller & Hans Peters, 2000. "The selectope for cooperative games," International Journal of Game Theory, Springer;Game Theory Society, vol. 29(1), pages 23-38.
    4. Einy, Ezra, 1988. "The shapley value on some lattices of monotonic games," Mathematical Social Sciences, Elsevier, vol. 15(1), pages 1-10, February.
    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. Leanne Streekstra & Christian Trudeau, 2024. "Stable source connection and assignment problems as multi-period shortest path problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(3), pages 939-975, September.
    2. F. Martínez-de-Albéniz & Carles Rafels, 2007. "Minimal large sets for cooperative games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 15(2), pages 242-255, December.
    3. Yokote, Koji & Funaki, Yukihiko & Kamijo, Yoshio, 2016. "A new basis and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 80(C), pages 21-24.
    4. Francesc Llerena & Carles Rafels, 2013. "Stable sets and max-convex decompositions of TU games," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(2), pages 313-322, July.
    5. Francesc Llerena & Carles Rafels, 2010. "Von Neumann-Morgenstern solution and convex descompositions of TU games," Working Papers in Economics 245, Universitat de Barcelona. Espai de Recerca en Economia.

    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. Francesc Llerena & Carlos Rafels Pallarola, 2004. "Max-convex decompositions for cooperative TU games," Working Papers in Economics 123, Universitat de Barcelona. Espai de Recerca en Economia.
    2. Leanne Streekstra & Christian Trudeau, 2024. "Stable source connection and assignment problems as multi-period shortest path problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(3), pages 939-975, September.
    3. Rodica Brânzei & Vito Fragnelli & Stef Tijs, 2002. "Tree-connected peer group situations and peer group games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 55(1), pages 93-106, March.
    4. Lukáš Adam & Tomáš Kroupa, 2017. "The intermediate set and limiting superdifferential for coalitional games: between the core and the Weber set," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(4), pages 891-918, November.
    5. Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games and capacities," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 24(2), pages 301-326, July.
    6. 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.
    7. 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.
    8. Sylvain Béal & Sylvain Ferrières & Philippe Solal, 2022. "The priority value for cooperative games with a priority structure," International Journal of Game Theory, Springer;Game Theory Society, vol. 51(2), pages 431-450, June.
    9. 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.
    10. Kamijo, Yoshio, 2009. "A linear proportional effort allocation rule," Mathematical Social Sciences, Elsevier, vol. 58(3), pages 341-353, November.
    11. Michel Grabisch & Agnieszka Rusinowska, 2020. "k -additive upper approximation of TU-games," PSE-Ecole d'économie de Paris (Postprint) halshs-02860802, HAL.
    12. Ulrich Faigle & Michel Grabisch, 2019. "Least Square Approximations and Linear Values of Cooperative Game," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-02381231, HAL.
    13. 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).
    14. Manfred Besner, 2022. "Harsanyi support levels solutions," Theory and Decision, Springer, vol. 93(1), pages 105-130, July.
    15. Rodica Branzei & Dinko Dimitrov & Stef Tijs, 2008. "Convex Games Versus Clan Games," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 10(04), pages 363-372.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. 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.

    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:eee:gamebe:v:54:y:2006:i:2:p:373-379. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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.