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: Working papers Articles

Working papers

  1. Arin Aguirre, Francisco Javier & Katsev, Ilya, 2013. "A monotonic core concept for convex games: The SD-prenucleolus," IKERLANAK Ikerlanak;2013-69, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.
  2. Arin Aguirre, Francisco Javier & Katsev, Ilya, 2013. "The coincidence of the kernel and nucleolus of a convex game: an alternative proof," IKERLANAK Ikerlanak;2013-67, Universidad del País Vasco - Departamento de Fundamentos del Análisis Económico I.

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.

Working papers

    Sorry, no citations of working papers recorded.

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. Khmelnitskaya, Anna B. & Sudhölter, Peter, 2011. "The prenucleolus for games with communication structures," Discussion Papers of Business and Economics 10/2011, University of Southern Denmark, Department of Business and Economics.
    3. 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.
    4. 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. 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 & 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. 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.
    2. Richard Baron & Sylvain Béal & Eric Rémila & Philippe Solal, 2011. "Average tree solutions and the distribution of Harsanyi dividends," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(2), pages 331-349, May.
    3. Ulrich Faigle & Michel Grabisch, 2012. "Values for Markovian coalition processes," PSE - Labex "OSE-Ouvrir la Science Economique" halshs-00749950, HAL.
    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. 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.
    6. 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.
    7. Sylvain Béal & Eric Rémila & Philippe Solal, 2015. "Characterization of the Average Tree solution and its kernel," Post-Print halshs-01212115, HAL.
    8. 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.
    9. 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.

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

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 1 paper announced in NEP. These are the fields, ordered by number of announcements, along with their dates. If the author is listed in the directory of specialists for this field, a link is also provided.
  1. NEP-GTH: Game Theory (1) 2013-03-30. Author is listed
  2. NEP-MIC: Microeconomics (1) 2013-03-30. Author is listed

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 hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.