IDEAS home Printed from https://ideas.repec.org/e/c/pfa5.html
   My authors  Follow this author

Ulrich Faigle

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. Ulrich Faigle & Michel Grabisch, 2017. "Game Theoretic Interaction and Decision: A Quantum Analysis," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01659148, HAL.

    Cited by:

    1. Masih Fadaki & Babak Abbasi & Prem Chhetri, 2022. "Quantum game approach for capacity allocation decisions under strategic reasoning," Computational Management Science, Springer, vol. 19(3), pages 491-512, July.

  2. Ulrich Faigle & Michel Grabisch & Andres Jiménez-Losada & Manuel Ordóñez, 2016. "Games on concept lattices: Shapley value and core," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01379699, HAL.

    Cited by:

    1. Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games and capacities," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01412292, HAL.
    2. Surajit Borkotokey & Loyimee Gogoi & Dhrubajit Choudhury & Rajnish Kumar, 2022. "Solidarity induced by group contributions: the MI $$^k$$ k -value for transferable utility games," Operational Research, Springer, vol. 22(2), pages 1267-1290, April.
    3. Ren, Hongbo & Wu, Qiong & Li, Qifen & Yang, Yongwen, 2020. "Optimal design and management of distributed energy network considering both efficiency and fairness," Energy, Elsevier, vol. 213(C).
    4. Wu, Qiong & Ren, Hongbo & Gao, Weijun & Ren, Jianxing & Lao, Changshi, 2017. "Profit allocation analysis among the distributed energy network participants based on Game-theory," Energy, Elsevier, vol. 118(C), pages 783-794.

  3. Ulrich Faigle & Michel Grabisch, 2016. "Bases and linear transforms of TU-games and cooperation systems," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01404509, HAL.

    Cited by:

    1. Ulrich Faigle & Michel Grabisch, 2017. "Game Theoretic Interaction and Decision: A Quantum Analysis," Post-Print halshs-01659148, HAL.
    2. Michel Grabisch & Agnieszka Rusinowska, 2020. "k -additive upper approximation of TU-games," PSE-Ecole d'économie de Paris (Postprint) halshs-02860802, HAL.
    3. Takayuki Oishi, 2019. "A General Derivation of Axiomatizations for Allocation Rules: Duality and Anti-Duality Approach," Keio-IES Discussion Paper Series 2019-011, Institute for Economics Studies, Keio University.
    4. Mihai Manea & Eric Rémila & Philippe Solal & Sylvain Béal, 2019. "Games with Identical Shapley Values," Post-Print hal-04418687, HAL.
    5. Sascha Kurz, 2018. "Importance In Systems With Interval Decisions," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 21(06n07), pages 1-23, September.

  4. Ulrich Faigle & Michel Grabisch, 2014. "Linear Transforms, Values and Least Square Approximation for Cooperation Systems," Documents de travail du Centre d'Economie de la Sorbonne 14010, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.

    Cited by:

    1. Michel Grabisch, 2015. "Fuzzy Measures and Integrals: Recent Developments," PSE-Ecole d'économie de Paris (Postprint) hal-01302377, HAL.
    2. Michel Grabisch, 2015. "Bases and transforms of set functions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01169287, HAL.
    3. Sylvain Béal & Eric Rémila & Philippe Solal, 2014. "Veto players, the kernel of the Shapley value and its characterization," Working Papers 2014-03, CRESE.

  5. Ulrich Faigle & Michel Grabisch, 2013. "A concise axiomatization of a Shapley-type value for stochastic coalition processes," Documents de travail du Centre d'Economie de la Sorbonne 13052, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.

    Cited by:

    1. Wang, Yaxian & Zhao, Zhenli & Baležentis, Tomas, 2023. "Benefit distribution in shared private charging pile projects based on modified Shapley value," Energy, Elsevier, vol. 263(PB).

  6. Ulrich Faigle & Michel Grabisch, 2013. "A Note on Values for Markovian Coalition Processes," PSE-Ecole d'économie de Paris (Postprint) halshs-00912889, HAL.

    Cited by:

    1. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Post-Print halshs-00881125, HAL.
    2. Ulrich Faigle & Michel Grabisch, 2013. "A concise axiomatization of a Shapley-type value for stochastic coalition processes," Documents de travail du Centre d'Economie de la Sorbonne 13052, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.

  7. Ulrich Faigle & Michel Grabisch, 2012. "Values for Markovian coalition processes," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00749950, HAL.

    Cited by:

    1. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2013. "An allocation rule for dynamic random network formation processes," Post-Print halshs-00881125, HAL.
    2. Ulrich Faigle & Michel Grabisch, 2017. "Game Theoretic Interaction and Decision: A Quantum Analysis," Post-Print halshs-01659148, HAL.
    3. van den Brink, R. & van der Laan, G. & Herings, P.J.J. & Talman, A.J.J., 2015. "The Average Tree permission value for games with a permission tree," Other publications TiSEM 97042492-4b03-4e72-b88d-d, Tilburg University, School of Economics and Management.
    4. Sylvain Béal & Eric Rémila & Philippe Solal, 2017. "Discounted Tree Solutions," Post-Print halshs-01413007, HAL.
    5. Ulrich Faigle & Michel Grabisch, 2013. "A concise axiomatization of a Shapley-type value for stochastic coalition processes," Documents de travail du Centre d'Economie de la Sorbonne 13052, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    6. Johan Eyckmans & Michael Finus & Lina Mallozziy, 2012. "A New Class of Welfare Maximizing Stable Sharing Rules for Partition Function Games with Externalities," Department of Economics Working Papers 6/12, University of Bath, Department of Economics.
    7. René Brink & Chris Dietz & Gerard Laan & Genjiu Xu, 2017. "Comparable characterizations of four solutions for permission tree games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(4), pages 903-923, April.
    8. Ulrich Faigle & Michel Grabisch, 2013. "A Note on Values for Markovian Coalition Processes," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00912889, HAL.

  8. Ulrich Faigle & Michel Grabisch, 2011. "A Discrete Choquet Integral for Ordered Systems," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00563926, HAL.

    Cited by:

    1. Michel Grabisch, 2015. "Fuzzy Measures and Integrals: Recent Developments," PSE-Ecole d'économie de Paris (Postprint) hal-01302377, HAL.
    2. Mustapha Ridaoui & Michel Grabisch, 2016. "Choquet integral calculus on a continuous support and its applications," Post-Print halshs-01411987, HAL.
    3. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Post-Print hal-00803233, HAL.
    4. Ulrich Faigle & Michel Grabisch & Andres Jiménez-Losada & Manuel Ordóñez, 2016. "Games on concept lattices: Shapley value and core," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01379699, HAL.
    5. Yaarit Even & Ehud Lehrer, 2014. "Decomposition-integral: unifying Choquet and the concave integrals," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(1), pages 33-58, May.
    6. Negi, Shekhar Singh & Torra, Vicenç, 2022. "Δ-Choquet integral on time scales with applications," Chaos, Solitons & Fractals, Elsevier, vol. 157(C).
    7. Yasuo Narukawa & Vicenç Torra & Michio Sugeno, 2016. "Choquet integral with respect to a symmetric fuzzy measure of a function on the real line," Annals of Operations Research, Springer, vol. 244(2), pages 571-581, September.

  9. Ulrich Faigle & Michel Grabisch & Maximilian Heyne, 2010. "Monge extensions of cooperation and communication structures," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00625336, HAL.

    Cited by:

    1. Alexandre Skoda, 2016. "Inheritance of Convexity for Partition Restricted Games," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01318105, HAL.
    2. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Documents de travail du Centre d'Economie de la Sorbonne 16019, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    3. Michel Grabisch, 2015. "Fuzzy Measures and Integrals: Recent Developments," PSE-Ecole d'économie de Paris (Postprint) hal-01302377, HAL.
    4. Michel Grabisch, 2010. "Ensuring the boundedness of the core of games with restricted cooperation," Post-Print halshs-00544134, HAL.
    5. Koshevoy, Gleb & Talman, Dolf, 2014. "Solution concepts for games with general coalitional structure," Mathematical Social Sciences, Elsevier, vol. 68(C), pages 19-30.
    6. Michel Grabisch & Peter Sudhölter, 2014. "On the restricted cores and the bounded core of games on distributive lattices," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00950109, HAL.
    7. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Post-Print hal-00803233, HAL.
    8. Ulrich Faigle & Michel Grabisch & Andres Jiménez-Losada & Manuel Ordóñez, 2016. "Games on concept lattices: Shapley value and core," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01379699, HAL.
    9. Alexandre Skoda, 2017. "Convexity of Graph-Restricted Games Induced by Minimum Partitions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01659804, HAL.
    10. Alexandre Skoda, 2016. "Inheritance of Convexity for Partition Restricted," Documents de travail du Centre d'Economie de la Sorbonne 16040, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    11. Alexandre Skoda, 2019. "Convexity of graph-restricted games induced by minimum partitions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01617023, HAL.
    12. Alexandre Skoda, 2017. "Inheritance of Convexity for the Pmin-Restricted Game," Documents de travail du Centre d'Economie de la Sorbonne 17051, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    13. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Post-Print hal-01305005, HAL.
    14. Alexandre Skoda, 2016. "Convexity of Network Restricted Games Induced by Minimum Partitions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01305005, HAL.
    15. Alexandre Skoda, 2017. "Inheritance of Convexity for the P min-Restricted Game," Post-Print halshs-01660670, HAL.
    16. E. Algaba & J. Bilbao & R. Brink, 2015. "Harsanyi power solutions for games on union stable systems," Annals of Operations Research, Springer, vol. 225(1), pages 27-44, February.
    17. Alexandre Skoda, 2017. "Convexity of Graph-Restricted Games Induced by Minimum Partitions," Documents de travail du Centre d'Economie de la Sorbonne 17049, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    18. Alexandre Skoda, 2016. "Complexity of inheritance of F-convexity for restricted games induced by minimum partitions," Post-Print halshs-01382502, HAL.
    19. Alexandre Skoda, 2017. "Convexity of Graph-Restricted Games Induced by Minimum Partitions," Post-Print halshs-01659804, HAL.
    20. Koshevoy, G.A. & Suzuki, T. & Talman, A.J.J., 2013. "Solutions For Games With General Coalitional Structure And Choice Sets," Discussion Paper 2013-012, Tilburg University, Center for Economic Research.
    21. Alexandre Skoda, 2020. "Inheritance of Convexity for the P˜min-Restricted Game," Post-Print halshs-02967120, HAL.
    22. Alexandre Skoda, 2016. "Inheritance of Convexity for Partition Restricted Games," Post-Print halshs-01318105, HAL.
    23. Encarnacion Algaba & Jesus Mario Bilbao & Rene van den Brink & Jorge J. Lopez, 2011. "The Myerson Value and Superfluous Supports in Union Stable Systems," Tinbergen Institute Discussion Papers 11-127/1, Tinbergen Institute.
    24. Alexandre Skoda, 2020. "Inheritance of Convexity for the P˜min-Restricted Game," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-02967120, HAL.
    25. A. Skoda, 2021. "Inheritance of convexity for the $$\mathcal {P}_{\min }$$ P min -restricted game," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 1-32, February.
    26. Alexandre Skoda, 2016. "Complexity of inheritance of F-convexity for restricted games induced by minimum partitions," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01382502, HAL.
    27. Alexandre Skoda, 2020. "Inheritance of Convexity for the P˜min-Restricted Game," Documents de travail du Centre d'Economie de la Sorbonne 20020, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    28. Alexandre Skoda, 2017. "Inheritance of Convexity for the P min-Restricted Game," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01660670, HAL.
    29. E. Algaba & J. M. Bilbao & R. Brink & J. J. López, 2012. "The Myerson Value and Superfluous Supports in Union Stable Systems," Journal of Optimization Theory and Applications, Springer, vol. 155(2), pages 650-668, November.
    30. Alexandre Skoda, 2019. "Convexity of graph-restricted games induced by minimum partitions," Post-Print halshs-01617023, HAL.
    31. Koshevoy, G.A. & Talman, A.J.J., 2011. "Solution Concepts for Games with General Coalitional Structure (Replaces CentER DP 2011-025)," Other publications TiSEM adf30f3d-a79b-4105-9736-c, Tilburg University, School of Economics and Management.
    32. Alexandre Skoda, 2016. "Complexity of inheritance of F-convexity for restricted games induced by minimum partitions," Documents de travail du Centre d'Economie de la Sorbonne 16055, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.

Articles

  1. Ulrich Faigle & Michel Grabisch, 2017. "Game Theoretic Interaction and Decision: A Quantum Analysis," Games, MDPI, vol. 8(4), pages 1-25, November.
    See citations under working paper version above.
  2. Ulrich Faigle & Michel Grabisch, 2016. "Bases and linear transforms of TU-games and cooperation systems," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(4), pages 875-892, November.
    See citations under working paper version above.
  3. Ulrich Faigle & Michel Grabisch, 2013. "A concise axiomatization of a Shapley-type value for stochastic coalition processes," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 1(2), pages 189-199, November.
    See citations under working paper version above.
  4. Ulrich Faigle & Michel Grabisch, 2013. "A note on values for Markovian coalition processes," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 1(2), pages 111-122, November.
    See citations under working paper version above.
  5. Ulrich Faigle & Michel Grabisch, 2012. "Values for Markovian coalition processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 51(3), pages 505-538, November.
    See citations under working paper version above.
  6. Faigle, U. & Grabisch, M. & Heyne, M., 2010. "Monge extensions of cooperation and communication structures," European Journal of Operational Research, Elsevier, vol. 206(1), pages 104-110, October.
    See citations under working paper version above.
  7. Jeroen Kuipers & Ulrich Faigle & Walter Kern, 2001. "On the computation of the nucleolus of a cooperative game," International Journal of Game Theory, Springer;Game Theory Society, vol. 30(1), pages 79-98.

    Cited by:

    1. Cesco, Juan Carlos, 2008. "A general characterization for non-balanced games in terms of U-cycles," European Journal of Operational Research, Elsevier, vol. 191(2), pages 409-415, December.
    2. Simai He & Jiawei Zhang & Shuzhong Zhang, 2012. "Polymatroid Optimization, Submodularity, and Joint Replenishment Games," Operations Research, INFORMS, vol. 60(1), pages 128-137, February.
    3. Péter Biró & Walter Kern & Daniël Paulusma, 2012. "Computing solutions for matching games," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 75-90, February.
    4. Nguyen, Tri-Dung & Thomas, Lyn, 2016. "Finding the nucleoli of large cooperative games," European Journal of Operational Research, Elsevier, vol. 248(3), pages 1078-1092.
    5. Ulrich Faigle & Walter Kern & Jeroen Kuipers, 2006. "Computing an Element in the Lexicographic Kernel of a Game," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 427-433, July.
    6. Elena Iñarra & Roberto Serrano & Ken-Ichi Shimomura, 2019. "The Nucleolus, the Kernel, and the Bargaining Set: An Update," Discussion Paper Series DP2019-12, Research Institute for Economics & Business Administration, Kobe University.
    7. Kuipers, Jeroen & Mosquera, Manuel A. & Zarzuelo, José M., 2013. "Sharing costs in highways: A game theoretic approach," European Journal of Operational Research, Elsevier, vol. 228(1), pages 158-168.
    8. Kimms, Alf & Çetiner, Demet, 2012. "Approximate nucleolus-based revenue sharing in airline alliances," European Journal of Operational Research, Elsevier, vol. 220(2), pages 510-521.
    9. Guajardo, Mario & Jörnsten, Kurt, 2014. "Common Mistakes in Computing the Nucleolus," Discussion Papers 2014/15, Norwegian School of Economics, Department of Business and Management Science.
    10. Drechsel, J. & Kimms, A., 2010. "Computing core allocations in cooperative games with an application to cooperative procurement," International Journal of Production Economics, Elsevier, vol. 128(1), pages 310-321, November.
    11. A. Palestini & G. Pignataro, 2013. "A multi-factor inequality approach to a transfer scheme: the case of Common Agricultural Policy," Working Papers wp891, Dipartimento Scienze Economiche, Universita' di Bologna.
    12. Takuya Masuzawa, 2008. "Computing the cores of strategic games with punishment–dominance relations," International Journal of Game Theory, Springer;Game Theory Society, vol. 37(2), pages 185-201, June.
    13. Xiaotie Deng & Qizhi Fang & Xiaoxun Sun, 2009. "Finding nucleolus of flow game," Journal of Combinatorial Optimization, Springer, vol. 18(1), pages 64-86, July.
    14. Andreas S. Schulz & Nelson A. Uhan, 2010. "Sharing Supermodular Costs," Operations Research, INFORMS, vol. 58(4-part-2), pages 1051-1056, August.
    15. Bayati, Mohsen & Borgs, Christian & Chayes, Jennifer & Kanoria, Yash & Montanari, Andrea, 2015. "Bargaining dynamics in exchange networks," Journal of Economic Theory, Elsevier, vol. 156(C), pages 417-454.
    16. Granot, Daniel & Hamers, Herbert & Kuipers, Jeroen & Maschler, Michael, 2011. "On Chinese postman games where residents of each road pay the cost of their road," Games and Economic Behavior, Elsevier, vol. 72(2), pages 427-438, June.

  8. Hunting, Marcel & Faigle, Ulrich & Kern, Walter, 2001. "A Lagrangian relaxation approach to the edge-weighted clique problem," European Journal of Operational Research, Elsevier, vol. 131(1), pages 119-131, May.

    Cited by:

    1. Jayaraman, Vaidyanathan & Gupta, Rakesh & Pirkul, Hasan, 2003. "Selecting hierarchical facilities in a service-operations environment," European Journal of Operational Research, Elsevier, vol. 147(3), pages 613-628, June.
    2. Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko, 2020. "A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 747-762, July.
    3. Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko, 2018. "A nonconvex quadratic optimization approach to the maximum edge weight clique problem," Journal of Global Optimization, Springer, vol. 72(2), pages 219-240, October.
    4. Michael M. Sørensen, 2004. "b-Tree Facets for the Simple Graph Partitioning Polytope," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 151-170, June.
    5. Abilio Lucena, 2005. "Non Delayed Relax-and-Cut Algorithms," Annals of Operations Research, Springer, vol. 140(1), pages 375-410, November.
    6. Alidaee, Bahram & Glover, Fred & Kochenberger, Gary & Wang, Haibo, 2007. "Solving the maximum edge weight clique problem via unconstrained quadratic programming," European Journal of Operational Research, Elsevier, vol. 181(2), pages 592-597, September.
    7. Martinhon, Carlos & Lucena, Abilio & Maculan, Nelson, 2004. "Stronger K-tree relaxations for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(1), pages 56-71, October.
    8. Sorensen, Michael M., 2004. "New facets and a branch-and-cut algorithm for the weighted clique problem," European Journal of Operational Research, Elsevier, vol. 154(1), pages 57-70, April.
    9. Lourenco, Lidia Lampreia & Pato, Margarida Vaz, 2007. "The effect of strengthened linear formulations on improving the lower bounds for the part families with precedence constraints problem," European Journal of Operational Research, Elsevier, vol. 183(1), pages 181-196, November.
    10. Borgwardt, S. & Schmiedl, F., 2014. "Threshold-based preprocessing for approximating the weighted dense k-subgraph problem," European Journal of Operational Research, Elsevier, vol. 234(3), pages 631-640.
    11. San Segundo, Pablo & Coniglio, Stefano & Furini, Fabio & Ljubić, Ivana, 2019. "A new branch-and-bound algorithm for the maximum edge-weighted clique problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 76-90.

  9. Ulrich Faigle & Walter Kern & Daniël Paulusma, 2000. "Note on the computational complexity of least core concepts for min-cost spanning tree games," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(1), pages 23-38, September.

    Cited by:

    1. Le Breton, Michel & Moreno-Ternero, Juan D. & Savvateev, Alexei & Weber, Shlomo, 2012. "Stability and Fairness in Models with a Multiple Membership," TSE Working Papers 12-300, Toulouse School of Economics (TSE).
    2. Ralf Borndörfer & Nam-Dũng Hoang, 2015. "Fair ticket pricing in public transport as a constrained cost allocation game," Annals of Operations Research, Springer, vol. 226(1), pages 51-68, March.
    3. Andreas S. Schulz & Nelson A. Uhan, 2010. "Sharing Supermodular Costs," Operations Research, INFORMS, vol. 58(4-part-2), pages 1051-1056, August.

  10. Jeroen Kuipers & Ulrich Faigle & Walter Kern, 1998. "Note Computing the nucleolus of min-cost spanning tree games is NP-hard," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(3), pages 443-450.

    Cited by:

    1. Ballester, Coralio, 2004. "NP-completeness in hedonic games," Games and Economic Behavior, Elsevier, vol. 49(1), pages 1-30, October.
    2. Sanjith Gopalakrishnan & Daniel Granot & Frieda Granot, 2021. "Consistent Allocation of Emission Responsibility in Fossil Fuel Supply Chains," Management Science, INFORMS, vol. 67(12), pages 7637-7668, December.
    3. Qizhi Fang & Bo Li & Xiaohan Shan & Xiaoming Sun, 2018. "Path cooperative games," Journal of Combinatorial Optimization, Springer, vol. 36(1), pages 211-229, July.
    4. Balázs Sziklai & Tamás Fleiner & Tamás Solymosi, 2014. "On the Core of Directed Acyclic Graph Games," CERS-IE WORKING PAPERS 1418, Institute of Economics, Centre for Economic and Regional Studies.
    5. Sung, Shao-Chin & Dimitrov, Dinko, 2010. "Computational complexity in additive hedonic games," European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
    6. Bergantiños, Gustavo & Vidal-Puga, Juan, 2020. "Cooperative games for minimum cost spanning tree problems," MPRA Paper 104911, University Library of Munich, Germany.
    7. F.Javier Martínez-de-Albéniz & Carles Rafels & Neus Ybern, 2015. "Insights into the nucleolus of the assignment game," UB School of Economics Working Papers 2015/333, University of Barcelona School of Economics.
    8. Tamas Solymosi & Balazs Sziklai, 2015. "Universal Characterization Sets for the Nucleolus in Balanced Games," CERS-IE WORKING PAPERS 1512, Institute of Economics, Centre for Economic and Regional Studies.
    9. Xiaotie Deng & Qizhi Fang & Xiaoxun Sun, 2009. "Finding nucleolus of flow game," Journal of Combinatorial Optimization, Springer, vol. 18(1), pages 64-86, July.
    10. Gustavo Bergantiños & Juan Vidal-Puga, 2021. "A review of cooperative rules and their associated algorithms for minimum-cost spanning tree problems," SERIEs: Journal of the Spanish Economic Association, Springer;Spanish Economic Association, vol. 12(1), pages 73-100, March.

  11. Ulrich Faigle & Walter Kern & Winfried Hochstättler & Sándor P. Fekete, 1997. "On the Complexity of Testing Membership in the Core of Min-Cost Spanning Tree Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 26(3), pages 361-366.

    Cited by:

    1. Xin Chen & Jiawei Zhang, 2009. "A Stochastic Programming Duality Approach to Inventory Centralization Games," Operations Research, INFORMS, vol. 57(4), pages 840-851, August.
    2. Sung, Shao-Chin & Dimitrov, Dinko, 2010. "Computational complexity in additive hedonic games," European Journal of Operational Research, Elsevier, vol. 203(3), pages 635-639, June.
    3. Ulrich Faigle & Walter Kern & Jeroen Kuipers, 2006. "Computing an Element in the Lexicographic Kernel of a Game," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(3), pages 427-433, July.
    4. Drechsel, J. & Kimms, A., 2010. "Computing core allocations in cooperative games with an application to cooperative procurement," International Journal of Production Economics, Elsevier, vol. 128(1), pages 310-321, November.
    5. Darko Skorin-Kapov, 2018. "Social enterprise tree network games," Annals of Operations Research, Springer, vol. 268(1), pages 5-20, September.
    6. Phuoc Hoang Le & Tri-Dung Nguyen & Tolga Bektaş, 2016. "Generalized minimum spanning tree games," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 167-188, May.

  12. Ulrich Faigle & Walter Kern, 1994. "Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints," Operations Research, INFORMS, vol. 42(4), pages 688-693, August.

    Cited by:

    1. Alper Atamtürk & Muhong Zhang, 2007. "Two-Stage Robust Network Flow and Design Under Demand Uncertainty," Operations Research, INFORMS, vol. 55(4), pages 662-673, August.
    2. Montiel, Luis & Dimitrakopoulos, Roussos, 2015. "Optimizing mining complexes with multiple processing and transportation alternatives: An uncertainty-based approach," European Journal of Operational Research, Elsevier, vol. 247(1), pages 166-178.
    3. Corinna Gottschalk & Hendrik Lüthen & Britta Peis & Andreas Wierz, 2018. "Optimization problems with color-induced budget constraints," Journal of Combinatorial Optimization, Springer, vol. 36(3), pages 861-870, October.

  13. Dijkhuizen, G. & Faigle, U., 1993. "A cutting-plane approach to the edge-weighted maximal clique problem," European Journal of Operational Research, Elsevier, vol. 69(1), pages 121-130, August.

    Cited by:

    1. Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko, 2020. "A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 747-762, July.
    2. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2023. "A general purpose exact solution method for mixed integer concave minimization problems," European Journal of Operational Research, Elsevier, vol. 309(3), pages 977-992.
    3. Seyedmohammadhossein Hosseinian & Dalila B. M. M. Fontes & Sergiy Butenko, 2018. "A nonconvex quadratic optimization approach to the maximum edge weight clique problem," Journal of Global Optimization, Springer, vol. 72(2), pages 219-240, October.
    4. Macambira, Elder Magalhaes & de Souza, Cid Carvalho, 2000. "The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations," European Journal of Operational Research, Elsevier, vol. 123(2), pages 346-371, June.
    5. Hunting, Marcel & Faigle, Ulrich & Kern, Walter, 2001. "A Lagrangian relaxation approach to the edge-weighted clique problem," European Journal of Operational Research, Elsevier, vol. 131(1), pages 119-131, May.
    6. Sinha, Ankur & Das, Arka & Anand, Guneshwar & Jayaswal, Sachin, 2021. "A General Purpose Exact Solution Method for Mixed Integer Concave Minimization Problems (revised as on 12/08/2021)," IIMA Working Papers WP 2021-03-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    7. Park, Kyungchul & Lee, Kyungsik & Park, Sungsoo, 1996. "An extended formulation approach to the edge-weighted maximal clique problem," European Journal of Operational Research, Elsevier, vol. 95(3), pages 671-682, December.
    8. Wu, Qinghua & Hao, Jin-Kao, 2015. "A review on algorithms for maximum clique problems," European Journal of Operational Research, Elsevier, vol. 242(3), pages 693-709.
    9. Sorensen, Michael M., 2004. "New facets and a branch-and-cut algorithm for the weighted clique problem," European Journal of Operational Research, Elsevier, vol. 154(1), pages 57-70, April.
    10. Zhou, Yi & Hao, Jin-Kao & Goëffon, Adrien, 2017. "PUSH: A generalized operator for the Maximum Vertex Weight Clique Problem," European Journal of Operational Research, Elsevier, vol. 257(1), pages 41-54.
    11. San Segundo, Pablo & Coniglio, Stefano & Furini, Fabio & Ljubić, Ivana, 2019. "A new branch-and-bound algorithm for the maximum edge-weighted clique problem," European Journal of Operational Research, Elsevier, vol. 278(1), pages 76-90.

  14. Faigle, U & Kern, W, 1992. "The Shapley Value for Cooperative Games under Precedence Constraints," International Journal of Game Theory, Springer;Game Theory Society, vol. 21(3), pages 249-266.

    Cited by:

    1. Ulrich Faigle & Michel Grabisch & Maximilian Heyne, 2010. "Monge extensions of cooperation and communication structures," Post-Print hal-00625336, HAL.
    2. Michel Grabisch, 2015. "Fuzzy Measures and Integrals: Recent Developments," PSE-Ecole d'économie de Paris (Postprint) hal-01302377, HAL.
    3. Fabien Lange & Michel Grabisch, 2006. "Values on regular games under Kirchhoff's laws," Cahiers de la Maison des Sciences Economiques b06087, Université Panthéon-Sorbonne (Paris 1).
    4. Chakrabarti, Subhadip & Ghintran, Amandine, 2013. "Assignment of Heterogeneous Agents in Trees under the Permission Value," MPRA Paper 49115, University Library of Munich, Germany.
    5. Herings, P.J.J. & van der Laan, G. & Talman, A.J.J., 2007. "The socially stable core in structured transferable utility games," Other publications TiSEM 28c8ea20-8a66-4d9e-b054-8, Tilburg University, School of Economics and Management.
    6. Michel Grabisch, 2010. "Ensuring the boundedness of the core of games with restricted cooperation," Post-Print halshs-00544134, HAL.
    7. Koshevoy, Gleb & Talman, Dolf, 2014. "Solution concepts for games with general coalitional structure," Mathematical Social Sciences, Elsevier, vol. 68(C), pages 19-30.
    8. Michel Grabisch & Fabien Lange, 2007. "Games on lattices, multichoice games and the Shapley value: a new approach," Post-Print halshs-00178916, HAL.
    9. Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games and capacities," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01412292, HAL.
    10. Hougaard, J. & Moreno-Ternero, J. & Tvede, M. & Osterdal, L., 2015. "Sharing the proceeds from a hierarchical venture," LIDAM Discussion Papers CORE 2015031, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    11. van den Brink, R. & van der Laan, G. & Herings, P.J.J. & Talman, A.J.J., 2015. "The Average Tree permission value for games with a permission tree," Other publications TiSEM 97042492-4b03-4e72-b88d-d, Tilburg University, School of Economics and Management.
    12. Stern, Ari & Tettenhorst, Alexander, 2019. "Hodge decomposition and the Shapley value of a cooperative game," Games and Economic Behavior, Elsevier, vol. 113(C), pages 186-198.
    13. Lijue Xie & Michel Grabisch, 2009. "The core of games on k-regular set systems," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00423922, HAL.
    14. László Á. Kóczy, 2014. "Power indices when players can commit to reject coalitions," CERS-IE WORKING PAPERS 1431, Institute of Economics, Centre for Economic and Regional Studies.
    15. Meng, Fanyong & Chen, Xiaohong & Zhang, Qiang, 2015. "A coalitional value for games on convex geometries with a coalition structure," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 605-614.
    16. Michel Grabisch & Peter Sudhölter, 2018. "On a class of vertices of the core," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-02043275, HAL.
    17. Sylvain Béal & Sylvain Ferrières & Philippe Solal, 2020. "The Priority Value for Cooperative Games with a Priority Structure," Working Papers 2020-02, CRESE.
    18. Ulrich Faigle & Michel Grabisch, 2013. "A concise axiomatization of a Shapley-type value for stochastic coalition processes," Documents de travail du Centre d'Economie de la Sorbonne 13052, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    19. Michel Grabisch & Peter Sudhölter, 2012. "The Bounded Core for Games with Precedence Constraints," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-00759893, HAL.
    20. Michel Grabisch, 2006. "Capacities and Games on Lattices: A Survey of Result," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00179830, HAL.
    21. Sylvain Béal & Issofa Moyouwou & Eric Rémila & Phillippe Solal, 2018. "Cooperative games on intersection closed systems and the Shapley value," Working Papers 2018-06, CRESE.
    22. Michel Grabisch & Peter Sudhölter, 2014. "On the restricted cores and the bounded core of games on distributive lattices," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00950109, HAL.
    23. Michel Grabisch & Tomáš Kroupa, 2018. "The cone of supermodular games on finite distributive lattices," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-01821712, HAL.
    24. Michel Grabisch, 2013. "The core of games on ordered structures and graphs," Post-Print hal-00803233, HAL.
    25. Ulrich Faigle & Michel Grabisch & Andres Jiménez-Losada & Manuel Ordóñez, 2016. "Games on concept lattices: Shapley value and core," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) hal-01379699, HAL.
    26. J. Bilbao & A. Jiménez-Losada & E. Lebrón & S. Tijs, 2002. "Theτ-value for games on matroids," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(1), pages 67-81, June.
    27. René van den Brink & Gerard van der Laan & Valeri Vasil'ev, 2007. "Distributing Dividends in Games with Ordered Players," Tinbergen Institute Discussion Papers 06-114/1, Tinbergen Institute.
    28. Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
    29. Michel Grabisch & Lijue Xie, 2008. "The core of games on distributive lattices: how to share benefits in a hierarchy," Post-Print halshs-00344802, HAL.
    30. Michel Grabisch & Peter Sudhölter, 2014. "The positive core for games with precedence constraints," Post-Print halshs-01020282, HAL.
    31. Michel Grabisch, 2016. "Remarkable polyhedra related to set functions, games," Documents de travail du Centre d'Economie de la Sorbonne 16081, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne.
    32. Khmelnitskaya, Anna & Talman, Dolf, 2014. "Tree, web and average web values for cycle-free directed graph games," European Journal of Operational Research, Elsevier, vol. 235(1), pages 233-246.
    33. Encarnación Algaba & René Brink & Chris Dietz, 2017. "Power Measures and Solutions for Games Under Precedence Constraints," Journal of Optimization Theory and Applications, Springer, vol. 172(3), pages 1008-1022, March.
    34. Michel Grabisch & Peter Sudhölter, 2016. "Characterizations of solutions for games with precedence constraints," PSE-Ecole d'économie de Paris (Postprint) hal-01297600, HAL.
    35. J. Bilbao & E. Lebrón & N. Jiménez, 2000. "Simple games on closure spaces," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 8(1), pages 43-55, June.
    36. René Brink & Chris Dietz & Gerard Laan & Genjiu Xu, 2017. "Comparable characterizations of four solutions for permission tree games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 63(4), pages 903-923, April.
    37. Sylvain Béal & Sylvain Ferrières & Adriana Navarro‐Ramos & Philippe Solal, 2023. "Axiomatic characterizations of the family of Weighted priority values," International Journal of Economic Theory, The International Society for Economic Theory, vol. 19(4), pages 787-816, December.
    38. Michel Grabisch & Lijue Xie, 2011. "The restricted core of games on distributive lattices: how to share benefits in a hierarchy," Université Paris1 Panthéon-Sorbonne (Post-Print and Working Papers) halshs-00583868, HAL.
    39. Labreuche, Christophe, 2011. "Interaction indices for games on combinatorial structures with forbidden coalitions," European Journal of Operational Research, Elsevier, vol. 214(1), pages 99-108, October.
    40. Bilbao, J.M. & Ordóñez, M., 2009. "Axiomatizations of the Shapley value for games on augmenting systems," European Journal of Operational Research, Elsevier, vol. 196(3), pages 1008-1014, August.
    41. Branzei, R. & Tijs, S. & Zarzuelo, J., 2009. "Convex multi-choice games: Characterizations and monotonic allocation schemes," European Journal of Operational Research, Elsevier, vol. 198(2), pages 571-575, October.
    42. Encarnacion Algaba & Sylvain Béal & Eric Rémila & Philippe Solal, 2019. "Harsanyi power solutions for cooperative games on voting structures," Post-Print halshs-02409438, HAL.
    43. Bilbao, J. M. & Lebron, E. & Jimenez, N., 1999. "The core of games on convex geometries," European Journal of Operational Research, Elsevier, vol. 119(2), pages 365-372, December.
    44. Algaba, A. & Bilbao, J.M. & van den Brink, J.R. & Jiménez-Losada, A., 2000. "Cooperative Games on Antimatroids," Other publications TiSEM 907b4b44-90f9-4faa-9473-8, Tilburg University, School of Economics and Management.
    45. Suzuki, T. & Talman, A.J.J., 2011. "Solution Concepts for Cooperative Games with Circular Communication Structure," Other publications TiSEM d863606f-a58a-4f92-894d-e, Tilburg University, School of Economics and Management.
    46. Hamers, Herbert & Husslage, Bart & Lindelauf, R. & Campen, Tjeerd, 2016. "A New Approximation Method for the Shapley Value Applied to the WTC 9/11 Terrorist Attack," Other publications TiSEM 8a67b416-1091-4efe-a1a6-7, Tilburg University, School of Economics and Management.
    47. Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2011. "Average Tree Solutions and the Distribution of Harsanyi Dividends," Post-Print halshs-00674425, HAL.
    48. Rene van den Brink & Ilya Katsev & Gerard van der Laan, 2023. "Properties of Solutions for Games on Union-Closed Systems," Mathematics, MDPI, vol. 11(4), pages 1-16, February.
    49. Derks, Jean & Peters, Hans, 1997. "Consistent restricted Shapley values," Mathematical Social Sciences, Elsevier, vol. 33(1), pages 75-91, February.
    50. Karl Ortmann, 2013. "A cooperative value in a multiplicative model," 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. 21(3), pages 561-583, September.
    51. A. Jiménez-Losada, 2017. "Comments on: Games with a permission structure - A survey on generalizations and applications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 39-41, April.
    52. Monjardet, Bernard, 2003. "The presence of lattice theory in discrete problems of mathematical social sciences. Why," Mathematical Social Sciences, Elsevier, vol. 46(2), pages 103-144, October.
    53. Xianghui Li & Bin Jiang & Yang Li, 2024. "The allowable value for cooperative games with restricted permutations," Annals of Operations Research, Springer, vol. 340(2), pages 943-959, September.
    54. René van den Brink, 2017. "Games with a Permission Structure: a survey on generalizations and applications," Tinbergen Institute Discussion Papers 17-016/II, Tinbergen Institute.
    55. Mikel Álvarez-Mozos & Rene van den Brink & Gerard van der Laan & Oriol Tejada, 2015. "From Hierarchies to Levels: New Solutions for Games with Hierarchical Structure," CER-ETH Economics working paper series 15/215, CER-ETH - Center of Economic Research (CER-ETH) at ETH Zurich.
    56. E. C. Gavilán & C. Manuel & R. Brink, 2023. "Directed communication in games with directed graphs," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 31(3), pages 584-617, October.
    57. E. Algaba & J. Bilbao & R. Brink, 2015. "Harsanyi power solutions for games on union stable systems," Annals of Operations Research, Springer, vol. 225(1), pages 27-44, February.
    58. Richard Baron & Sylvain Béal & Éric Rémila & Philippe Solal, 2008. "Average tree solutions for graph games," Post-Print hal-00332570, HAL.
    59. René Brink, 2017. "Games with a permission structure - A survey on generalizations and applications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 1-33, April.
    60. Emilio Calvo & Esther Gutiérrez-López, 2015. "The value in games with restricted cooperation," Discussion Papers in Economic Behaviour 0115, University of Valencia, ERI-CES.
    61. Koshevoy, G.A. & Suzuki, T. & Talman, A.J.J., 2013. "Solutions For Games With General Coalitional Structure And Choice Sets," Discussion Paper 2013-012, Tilburg University, Center for Economic Research.
    62. Daniel Li Li & Erfang Shan, 2021. "Cooperative games with partial information," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 297-309, March.
    63. Phuoc Hoang Le & Tri-Dung Nguyen & Tolga Bektaş, 2016. "Generalized minimum spanning tree games," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 4(2), pages 167-188, May.
    64. Tom C. van der Zanden & Hans L. Bodlaender & Herbert J. M. Hamers, 2023. "Efficiently computing the Shapley value of connectivity games in low-treewidth graphs," Operational Research, Springer, vol. 23(1), pages 1-23, March.
    65. Derks, Jean, 2018. "The Shapley value of conjunctive-restricted games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 146-151.
    66. Encarnacion Algaba & Rene van den Brink, 2019. "The Shapley Value and Games with Hierarchies," Tinbergen Institute Discussion Papers 19-064/II, Tinbergen Institute.
    67. Miguel Ángel Mirás Calvo & Carmen Quinteiro Sandomingo & Estela Sánchez Rodríguez, 2020. "The boundary of the core of a balanced game: face games," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(2), pages 579-599, June.
    68. David Lowing & Kevin Techer, 2022. "Priority relations and cooperation with multiple activity levels," Post-Print hal-04097838, HAL.
    69. René van den Brink & Gerard van der Laan & Valeri Vasil'ev, 0000. "The Restricted Core for Totally Positive Games with Ordered Players," Tinbergen Institute Discussion Papers 09-038/1, Tinbergen Institute.
    70. Encarnacion Algaba & Eric Remila & Philippe Solal, 2024. "Flow methods for cooperative games with generalized coalition configuration," Papers 2411.13684, arXiv.org.
    71. 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.
    72. Guihua Wang & Quan Guo & Qiong Jiang & Butong Li, 2022. "A Study on the Relationship between Corporate Social Responsibility and Supply Chain Profit Distribution in the Context of Common Prosperity," Sustainability, MDPI, vol. 14(19), pages 1-18, September.
    73. Encarnación Algaba & René Brink & Chris Dietz, 2018. "Network Structures with Hierarchy and Communication," Journal of Optimization Theory and Applications, Springer, vol. 179(1), pages 265-282, October.
    74. Encarnacion Algaba & René van den Brink & Chris Dietz, 2015. "Power Measures and Solutions for Games under Precedence Constraints," Tinbergen Institute Discussion Papers 15-007/II, Tinbergen Institute.
    75. Michel Grabisch & Lijue Xie, 2007. "A new approach to the core and Weber set of multichoice games," Post-Print halshs-00267933, HAL.
    76. Eduard Kromer & Ludger Overbeck, 2013. "Suitability of Capital Allocations for Performance Measurement," Papers 1301.5497, arXiv.org, revised Jul 2014.
    77. Hans Peters & Horst Zank, 2005. "The Egalitarian Solution for Multichoice Games," Annals of Operations Research, Springer, vol. 137(1), pages 399-409, July.
    78. Mikel Álvarez-Mozos & René van den Brink & Gerard van der Laan & Oriol Tejada, 2015. "From Hierarchies to Levels: New Solutions for Games," Tinbergen Institute Discussion Papers 15-072/II, Tinbergen Institute.
    79. J. Bilbao & A. Jiménez-Losada & E. Lebrón & C. Chacón, 2005. "Values for Interior Operator Games," Annals of Operations Research, Springer, vol. 137(1), pages 141-160, July.
    80. Hamers, Herbert & Husslage, Bart & Lindelauf, R. & Campen, Tjeerd, 2016. "A New Approximation Method for the Shapley Value Applied to the WTC 9/11 Terrorist Attack," Discussion Paper 2016-042, Tilburg University, Center for Economic Research.
    81. Bilbao, J. M., 1998. "Axioms for the Shapley value on convex geometries," European Journal of Operational Research, Elsevier, vol. 110(2), pages 368-376, October.
    82. Arroyo, Federico, 2024. "Cost Allocation in Vehicle Routing Problems with Time Windows," Junior Management Science (JUMS), Junior Management Science e. V., vol. 9(1), pages 1241-1268.
    83. Iago Núñez Lugilde & Arantza Estévez-Fernández & Estela Sánchez-Rodríguez, 2024. "Priority coalitional games and claims problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(3), pages 669-701, December.
    84. Xianghui Li & Yang Li, 2021. "On the Structural Stability of Values for Cooperative Games," Journal of Optimization Theory and Applications, Springer, vol. 189(3), pages 873-888, June.
    85. Estela Sánchez-Rodríguez & Miguel Ángel Mirás Calvo & Carmen Quinteiro Sandomingo & Iago Núñez Lugilde, 2024. "Coalition-weighted Shapley values," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(2), pages 547-577, June.
    86. Yu-Hsien Liao, 2018. "The precore: converse consistent enlargements and alternative axiomatic results," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(1), pages 146-163, April.
    87. Elena Parilina & Artem Sedakov, 2014. "Stable Bank Cooperation for Cost Reduction Problem," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 8(1), pages 7-25, August.
    88. Khmelnitskaya, A. & Selçuk, O. & Talman, A.J.J., 2014. "The Shapley Value for Directed Graph Games," Other publications TiSEM 86cd17d2-cbc2-43ed-a4af-7, Tilburg University, School of Economics and Management.
    89. Tongseok Lim, 2021. "A Hodge theoretic extension of Shapley axioms," Papers 2106.15094, arXiv.org, revised Sep 2021.
    90. Zhengxing Zou & Qiang Zhang, 2018. "Harsanyi power solution for games with restricted cooperation," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 26-47, January.
    91. Koshevoy, G.A. & Talman, A.J.J., 2011. "Solution Concepts for Games with General Coalitional Structure (Replaces CentER DP 2011-025)," Other publications TiSEM adf30f3d-a79b-4105-9736-c, Tilburg University, School of Economics and Management.
    92. Takashi Ui & Hiroyuki Kojima & Atsushi Kajii, 2011. "The Myerson value for complete coalition structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 427-443, December.
    93. Zhengxing Zou & Qiang Zhang & Surajit Borkotokey & Xiaohui Yu, 2020. "The extended Shapley value for generalized cooperative games under precedence constraints," Operational Research, Springer, vol. 20(2), pages 899-925, June.
    94. Masayoshi Mase & Art B. Owen & Benjamin B. Seiler, 2022. "Variable importance without impossible data," Papers 2205.15750, arXiv.org, revised Apr 2023.
    95. Edelman, Paul H., 1997. "A note on voting," Mathematical Social Sciences, Elsevier, vol. 34(1), pages 37-50, August.
    96. Algaba, A. & Bilbao, J.M. & van den Brink, J.R. & Jiménez-Losada, A., 2000. "Cooperative Games on Antimatroids," Discussion Paper 2000-124, Tilburg University, Center for Economic Research.

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