default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElena Yanovskaya
Person information
- affiliation: Russian Academy of Sciences, Insitute for Economics and Mathematics, Saint Petersburg, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j17]Elena Yanovskaya:
Rich Extensions of the Core and the Equal Split Off Set. IGTR 25(2): 2350005:1-2350005:20 (2023)- [j16]Bas J. Dietzenbacher
, Elena Yanovskaya:
The equal split-off set for NTU-games. Math. Soc. Sci. 121: 61-67 (2023) - 2021
- [j15]Elena B. Yanovskaya:
An Extension of a Class of Cost Sharing Methods to the Class of Solutions to Two-Person Cooperative Games. Autom. Remote. Control. 82(12): 2239-2260 (2021) - [j14]Bas J. Dietzenbacher, Elena Yanovskaya:
Consistency of the equal split-off set. Int. J. Game Theory 50(1): 1-22 (2021) - [j13]Anna Bogomolnaia, Misha Gavrilovich, Egor Ianovski, Galina Lyapunova, Hervé Moulin, Alexander S. Nesterov, Marina Sandomirskaia, Fedor Sandomirskiy, Elena Yanovskaya:
In memory of Victoria Kreps (3 September 1945-3 March 2021). Int. J. Game Theory 50(3): 597-601 (2021) - [j12]Bas J. Dietzenbacher, Elena Yanovskaya:
Self-antidual extensions and subsolutions. Math. Soc. Sci. 114: 105-109 (2021) - 2020
- [j11]Bas J. Dietzenbacher, Elena Yanovskaya:
Antiduality in exact partition games. Math. Soc. Sci. 108: 116-121 (2020)
2010 – 2019
- 2018
- [j10]Elena B. Yanovskaya:
Self-Covariant and Consistent Solutions of Transferable Utility Cooperative Games. Autom. Remote. Control. 79(12): 2237-2258 (2018) - 2017
- [i3]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya:
Competitive division of a mixed manna. CoRR abs/1702.00616 (2017) - 2016
- [j9]Elena B. Yanovskaya:
The bounded core for games with restricted cooperation. Autom. Remote. Control. 77(9): 1699-1710 (2016) - [i2]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya:
Dividing goods or bads under additive utilities. CoRR abs/1608.01540 (2016) - [i1]Anna Bogomolnaia, Hervé Moulin, Fedor Sandomirskiy, Elena Yanovskaya:
Dividing goods and bads under additive utilities. CoRR abs/1610.03745 (2016) - 2013
- [j8]Ilya Katsev, Elena Yanovskaya:
The prenucleolus for games with restricted cooperation. Math. Soc. Sci. 66(1): 56-65 (2013) - 2010
- [j7]Elena Yanovskaya:
The Extension of Dutta-Ray's Solution to Convex NTU Games. IGTR 12(4): 339-361 (2010)
2000 – 2009
- 2007
- [j6]Anna B. Khmelnitskaya, Elena B. Yanovskaya:
Owen coalitional value without additivity axiom. Math. Methods Oper. Res. 66(2): 255-261 (2007) - 2004
- [j5]Elena Yanovskaya:
Consistent and covariant solutions for TU games. Int. J. Game Theory 32(4): 485-500 (2004) - 2002
- [j4]Elena Yanovskaya:
Consistency for Proportional solutions. IGTR 4(3): 343-356 (2002) - [j3]Elena Yanovskaya, Theo S. H. Driessen:
Note On linear consistency of anonymous values for TU-games. Int. J. Game Theory 30(4): 601-609 (2002) - 2001
- [j2]Natalia I. Naumova, Elena Yanovskaya:
Nash social welfare orderings. Math. Soc. Sci. 42(3): 203-231 (2001)
1990 – 1999
- 1999
- [j1]Elena Yanovskaya:
Strongly Consistent solutions to Balanced TU Games. IGTR 1(1): 63-85 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:58 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
