Остановите войну!
for scientists:
default search action
Gerard van der Laan
- > Home > Persons > Gerard van der Laan
Publications
- 2017
- [j43]Mikel Álvarez-Mozos, René van den Brink, Gerard van der Laan, Oriol Tejada:
From hierarchies to levels: new solutions for games with hierarchical structure. Int. J. Game Theory 46(4): 1089-1113 (2017) - 2016
- [j42]René van den Brink, Anna B. Khmelnitskaya, Gerard van der Laan:
An Owen-type value for games with two-level communication structure. Ann. Oper. Res. 243(1-2): 179-198 (2016) - 2014
- [j41]René van den Brink, Gerard van der Laan, Valeri A. Vasil'ev:
Constrained core solutions for totally positive games with ordered players. Int. J. Game Theory 43(2): 351-368 (2014) - [j40]René van den Brink, Arantza Estévez-Fernández, Gerard van der Laan, Nigel Moes:
Independence of downstream and upstream benefits in river water allocation problems. Soc. Choice Welf. 43(1): 173-194 (2014) - 2013
- [j39]Mikel Álvarez-Mozos, René van den Brink, Gerard van der Laan, Oriol Tejada:
Share functions for cooperative games with levels structure of cooperation. Eur. J. Oper. Res. 224(1): 167-179 (2013) - [j38]René van den Brink, Yukihiko Funaki, Gerard van der Laan:
Characterization of the Reverse Talmud bankruptcy rule by Exemption and Exclusion properties. Eur. J. Oper. Res. 228(2): 413-417 (2013) - [j37]René van den Brink, Gerard van der Laan, Nigel Moes:
A strategic implementation of the Average Tree solution for cycle-free graph games. J. Econ. Theory 148(6): 2737-2748 (2013) - 2011
- [j35]René van den Brink, Gerard van der Laan, Vitaly Pruzhansky:
Harsanyi power solutions for graph-restricted games. Int. J. Game Theory 40(1): 87-110 (2011) - [j34]René van den Brink, Ilya Katsev, Gerard van der Laan:
A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure. Int. J. Game Theory 40(3): 591-616 (2011) - 2010
- [j33]René van den Brink, Ilya Katsev, Gerard van der Laan:
An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure. Eur. J. Oper. Res. 207(2): 817-826 (2010) - 2007
- [j28]René van den Brink, Gerard van der Laan:
Potentials and reduced games for share functions. Discret. Math. 307(19-20): 2385-2399 (2007) - 2005
- [j21]René van den Brink, Gerard van der Laan:
A class of consistent share functions for games in coalition structure. Games Econ. Behav. 51(1): 193-212 (2005) - 2001
- [j16]René van den Brink, Gerard van der Laan:
Core concepts for share vectors. Soc. Choice Welf. 18(4): 759-784 (2001)
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 2023-10-02 01:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint