IDEAS home Printed from https://ideas.repec.org/f/pka816.html
   My authors  Follow this author

Ilya Katsev

Personal Details

First Name:Ilya
Middle Name:
Last Name:Katsev
Suffix:
RePEc Short-ID:pka816

Affiliation

St. Petersburg Institute for Economics and Mathematics
Russian Academy of Sciences (RAS)

St. Petersburg, Russia
http://emi.nw.ru/
RePEc:edi:iesraru (more details at EDIRC)

Research output

as
Jump to: Articles

Articles

  1. Katsev, Ilya & Yanovskaya, Elena, 2013. "The prenucleolus for games with restricted cooperation," Mathematical Social Sciences, Elsevier, vol. 66(1), pages 56-65.
  2. Driessen, Theo S.H. & Fragnelli, Vito & Katsev, Ilya V. & Khmelnitskaya, Anna B., 2011. "On 1-convexity and nucleolus of co-insurance games," Insurance: Mathematics and Economics, Elsevier, vol. 48(2), pages 217-225, March.
  3. 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.
  4. René Brink & Ilya Katsev & Gerard Laan, 2011. "Axiomatizations of two types of Shapley values for games on union closed systems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 47(1), pages 175-188, May.
  5. 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.

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.

Articles

  1. Katsev, Ilya & Yanovskaya, Elena, 2013. "The prenucleolus for games with restricted cooperation," Mathematical Social Sciences, Elsevier, vol. 66(1), pages 56-65.

    Cited by:

    1. Anna Khmelnitskaya & Peter Sudhölter, 2013. "The prenucleolus and the prekernel for games with communication structures," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(2), pages 285-299, October.
    2. Schouten, Jop, 2022. "Cooperation, allocation and strategy in interactive decision-making," Other publications TiSEM d5d41448-8033-4f6b-8ec0-c, Tilburg University, School of Economics and Management.
    3. Khmelnitskaya, Anna B. & Sudhölter, Peter, 2011. "The prenucleolus for games with communication structures," Discussion Papers on Economics 10/2011, University of Southern Denmark, Department of Economics.
    4. 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.
    5. Schouten, Jop & Dietzenbacher, Bas & Borm, Peter, 2019. "The Nucleolus and Inheritance of Properties in Communication Situations," Discussion Paper 2019-008, Tilburg University, Center for Economic Research.
    6. J. Schouten & B. Dietzenbacher & P. Borm, 2022. "The nucleolus and inheritance of properties in communication situations," Annals of Operations Research, Springer, vol. 318(2), pages 1117-1135, November.
    7. Natalia I. Naumova, 2022. "Some solutions for generalized games with restricted cooperation," Annals of Operations Research, Springer, vol. 318(2), pages 1077-1093, November.
    8. P. García-Segador & P. Miranda, 2020. "Order cones: a tool for deriving k-dimensional faces of cones of subfamilies of monotone games," Annals of Operations Research, Springer, vol. 295(1), pages 117-137, December.
    9. 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.
    10. Encarnación Algaba & Rene van den Brink & Chris Dietz, 2013. "Cooperative Games on Accessible Union Stable Systems," Tinbergen Institute Discussion Papers 13-207/II, Tinbergen Institute.
    11. 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.

  2. Driessen, Theo S.H. & Fragnelli, Vito & Katsev, Ilya V. & Khmelnitskaya, Anna B., 2011. "On 1-convexity and nucleolus of co-insurance games," Insurance: Mathematics and Economics, Elsevier, vol. 48(2), pages 217-225, March.

    Cited by:

    1. Theo Driessen & Dongshuang Hou, 2010. "A note on the nucleolus for 2-convex TU games," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(1), pages 185-189, March.

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

    Cited by:

    1. Tamás Solymosi, 2019. "Weighted nucleoli and dually essential coalitions," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(4), pages 1087-1109, December.
    2. 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.
    3. 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.
    4. 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.
    5. Tamás Solymosi, 2019. "Weighted nucleoli and dually essential coalitions (extended version)," CERS-IE WORKING PAPERS 1914, Institute of Economics, Centre for Economic and Regional Studies.

  4. René Brink & Ilya Katsev & Gerard Laan, 2011. "Axiomatizations of two types of Shapley values for games on union closed systems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 47(1), pages 175-188, May.

    Cited by:

    1. Sylvain Béal & Marc Deschamps & Mostapha Diss & Rodrigue Tido Takeng, 2024. "Cooperative games with diversity constraints," Working Papers 2024-06, CRESE.
    2. Sylvain Béal & André Casajus & Eric Rémila & Philippe Solal, 2021. "Cohesive efficiency in TU-games: axiomatizations of variants of the Shapley value, egalitarian values and their convex combinations," Annals of Operations Research, Springer, vol. 302(1), pages 23-47, July.
    3. 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.
    4. 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.
    5. 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.
    6. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Characterization of the Average Tree solution and its kernel," Post-Print halshs-01212115, HAL.
    7. Sylvain Béal & André Casajus & Eric Rémila & Philippe Solal, 2019. "Cohesive efficiency in TU-games: Two extensions of the Shapley value," Working Papers 2019-03, CRESE.
    8. Encarnacion Algaba & Rene van den Brink, 2021. "Networks, Communication and Hierarchy: Applications to Cooperative Games," Tinbergen Institute Discussion Papers 21-019/IV, Tinbergen Institute.
    9. 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.
    10. Julia Belau, 2013. "An outside-option-sensitive allocation rule for networks: the kappa-value," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 1(2), pages 175-188, November.
    11. 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.
    12. 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.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. Derks, Jean, 2018. "The Shapley value of conjunctive-restricted games," Games and Economic Behavior, Elsevier, vol. 108(C), pages 146-151.
    18. Encarnacion Algaba & Rene van den Brink, 2019. "The Shapley Value and Games with Hierarchies," Tinbergen Institute Discussion Papers 19-064/II, Tinbergen Institute.
    19. 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.

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

    Cited by:

    1. 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.
    2. Keyzer, Michiel & van Wesenbeeck, Cornelia, 2011. "Optimal coalition formation and surplus distribution: Two sides of one coin," European Journal of Operational Research, Elsevier, vol. 215(3), pages 604-615, December.
    3. 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.
    4. Natalia I. Naumova, 2022. "Some solutions for generalized games with restricted cooperation," Annals of Operations Research, Springer, vol. 318(2), pages 1077-1093, November.
    5. 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.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, Ilya Katsev should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can 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.