IDEAS home Printed from https://ideas.repec.org/f/pgu886.html

Vasily Gusev

Personal Details

First Name:Vasily
Middle Name:
Last Name:Gusev
Suffix:
RePEc Short-ID:pgu886
[This author has chosen not to make the email address public]
https://www.hse.ru/en/org/persons/325138730/#sci

Affiliation

International Laboratory of Game Theory and Decision Making
Saint Petersburg Branch, School of Economics and Management
National Research University Higher School of Economics (HSE)

St. Petersburg, Russia
https://game.hse.ru/
RePEc:edi:gthseru (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Vasily Gusev & Iakov Zhukov, 2024. "On the Existence of Nash-stable Partition in Leader's Coalition Games," HSE Working papers WP BRP 268/EC/2024, National Research University Higher School of Economics.
  2. Vasily V. Gusev, 2023. "The punctuality stability of the Nash equilibrium: the advantage of a late player in potential and aggregative games," HSE Working papers WP BRP 261/EC/2023, National Research University Higher School of Economics.
  3. Vasily V. Gusev, 2021. "Cooperative congestion games," HSE Working papers WP BRP 245/EC/2021, National Research University Higher School of Economics.
  4. Vasily V. Gusev, 2021. "Set-weighted games and their application to the cover problem," HSE Working papers WP BRP 247/EC/2021, National Research University Higher School of Economics.

Articles

  1. Vasily Gusev, 2026. "Stable coalition structures for transversal problems," Annals of Operations Research, Springer, vol. 356(2), pages 921-948, January.
  2. Gusev, Vasily & Nesterov, Alexander & Reshetov, Mikhail & Suzdaltsev, Alex, 2024. "The existence of a pure-strategy Nash equilibrium in a discrete ponds dilemma," Games and Economic Behavior, Elsevier, vol. 147(C), pages 38-51.
  3. Gusev, Vasily V., 2023. "Set-weighted games and their application to the cover problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 438-450.
  4. Gusev, Vasily V., 2021. "Nash-stable coalition partition and potential functions in games with coalition structure," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1180-1188.
  5. Gusev, Vasily V., 2020. "The vertex cover game: Application to transport networks," Omega, Elsevier, vol. 97(C).

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. Gusev, Vasily V., 2021. "Nash-stable coalition partition and potential functions in games with coalition structure," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1180-1188.

    Cited by:

    1. Jun Su & Yilin Chen & Dongyu Zhang, 2024. "Game Model of Stable Cooperation During Resource Distribution in Self-Organized Emergency Management System," Group Decision and Negotiation, Springer, vol. 33(6), pages 1325-1353, December.
    2. Alcalde-Unzu, Jorge & Gallo, Oihane & Inarra, Elena & Moreno-Ternero, Juan D., 2024. "Solidarity to achieve stability," European Journal of Operational Research, Elsevier, vol. 315(1), pages 368-377.

  2. Gusev, Vasily V., 2020. "The vertex cover game: Application to transport networks," Omega, Elsevier, vol. 97(C).

    Cited by:

    1. Pelegrín, Mercedes & Xu, Liding, 2023. "Continuous covering on networks: Improved mixed integer programming formulations," Omega, Elsevier, vol. 117(C).
    2. Gusev, Vasily V., 2023. "Set-weighted games and their application to the cover problem," European Journal of Operational Research, Elsevier, vol. 305(1), pages 438-450.
    3. Gusev, Vasily V., 2021. "Nash-stable coalition partition and potential functions in games with coalition structure," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1180-1188.
    4. Kameng Nip & Tianning Shi & Zhenbo Wang, 2022. "Some graph optimization problems with weights satisfying linear constraints," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 200-225, January.
    5. Luo, Chunlin & Zhou, Xiaoyang & Lev, Benjamin, 2022. "Core, shapley value, nucleolus and nash bargaining solution: A Survey of recent developments and applications in operations management," Omega, Elsevier, vol. 110(C).
    6. Sergei Dotsenko & Vladimir Mazalov, 2021. "A Cooperative Network Packing Game with Simple Paths," Mathematics, MDPI, vol. 9(14), pages 1-18, July.
    7. Vasily V. Gusev, 2021. "Set-weighted games and their application to the cover problem," HSE Working papers WP BRP 247/EC/2021, National Research University Higher School of Economics.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

NEP Fields

NEP is an announcement service for new working papers, with a weekly report in each of many fields. This author has had 4 papers 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 (4) 2021-04-26 2021-07-12 2023-05-01 2024-11-11. Author is listed
  2. NEP-CDM: Collective Decision-Making (1) 2024-11-11. Author is listed
  3. NEP-CIS: Confederation of Independent States (1) 2021-07-12. Author is listed
  4. NEP-DES: Economic Design (1) 2024-11-11. Author is listed
  5. NEP-MIC: Microeconomics (1) 2023-05-01. Author is listed
  6. NEP-NET: Network Economics (1) 2021-07-12. Author is listed
  7. NEP-ORE: Operations Research (1) 2021-07-12. Author is listed
  8. NEP-SPO: Sports and Economics (1) 2023-05-01. Author is listed
  9. NEP-TRA: Transition Economics (1) 2021-07-12. 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, Vasily Gusev 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.