default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGerard van der Laan
Person information
- affiliation: VU University, Department of Econometrics and Tinbergen Institute, Amsterdam, The Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 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
- [j36]Gerard van der Laan, Dolf Talman, Zaifu Yang:
Solving discrete systems of nonlinear equations. Eur. J. Oper. Res. 214(3): 493-500 (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) - [j32]P. Jean-Jacques Herings, Gerard van der Laan, A. J. J. Talman, Zaifu Yang:
The average tree solution for cooperative games with communication structure. Games Econ. Behav. 68(2): 626-633 (2010)
2000 – 2009
- 2008
- [j31]P. Jean-Jacques Herings, Gerard van der Laan, Dolf Talman:
The average tree solution for cycle-free graph games. Games Econ. Behav. 62(1): 77-92 (2008) - [j30]P. Jean-Jacques Herings, Gerard van der Laan, Dolf Talman, Zaifu Yang:
A fixed point theorem for discontinuous functions. Oper. Res. Lett. 36(1): 89-93 (2008) - 2007
- [j29]Gerard van der Laan, Dolf Talman, Zaifu Yang:
Computing integral solutions of complementarity problems. Discret. Optim. 4(3-4): 315-321 (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) - [j27]P. Jean-Jacques Herings, Gerard van der Laan, Dolf Talman:
The socially stable core in structured transferable utility games. Games Econ. Behav. 59(1): 85-104 (2007) - [j26]Jurjen Kamphorst, Gerard van der Laan:
Network Formation under Heterogeneous Costs: the Multiple Group Model. IGTR 9(4): 599-635 (2007) - [j25]Gerard van der Laan, Dolf Talman, Zaifu Yang:
A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems. SIAM J. Optim. 18(1): 290-308 (2007) - 2006
- [j24]Jean Derks, Gerard van der Laan, Valery A. Vasil'ev:
Characterizations of the Random Order Values by Harsanyi Payoff Vectors. Math. Methods Oper. Res. 64(1): 155-163 (2006) - [j23]Gerard van der Laan, Dolf Talman, Zaifu Yang:
Solving discrete zero point problems. Math. Program. 108(1): 127-134 (2006) - [j22]Gerard van der Laan, Dolf Talman, Zaifu Yang:
Refinements of Stationary Points with Applications to Noncooperative Games and Economics. SIAM J. Optim. 16(3): 854-870 (2006) - 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) - [j20]P. Jean-Jacques Herings, Gerard van der Laan, Dolf Talman:
The positional power of nodes in digraphs. Soc. Choice Welf. 24(3): 439-454 (2005) - 2002
- [j19]Gerard van der Laan, Harold Houba:
One-Seller/Two-Buyer Markets with Buyer Externalities and (im)Perfect Competition. IGTR 4(2): 141-164 (2002) - [j18]Gerard van der Laan, Dolf Talman, Zaifu Yang:
Existence and Welfare Properties of Equilibrium in an Exchange Economy with Multiple Divisible and Indivisible Commodities and Linear Production Technologies. J. Econ. Theory 103(2): 411-428 (2002) - 2001
- [j17]Gerard van der Laan, Dolf Talman, Zaifu Yang:
Existence of Balanced Simplices on Polytopes. J. Comb. Theory A 96(2): 288-302 (2001) - [j16]René van den Brink, Gerard van der Laan:
Core concepts for share vectors. Soc. Choice Welf. 18(4): 759-784 (2001)
1990 – 1999
- 1999
- [j15]Gerard van der Laan, Dolf Talman, Zaifu Yang:
Intersection theorems on polytopes. Math. Program. 84(1): 25-38 (1999) - 1994
- [j14]Antoon van den Elzen, Gerard van der Laan, Dolf Talman:
An Adjustment Process for an Economy with Linear Production Technologies. Math. Oper. Res. 19(2): 341-351 (1994) - 1993
- [j13]Gerard van der Laan, Hans Kremers:
On the existence and computation of an equilibrium in an economy with constant returns to scale production. Ann. Oper. Res. 44(2): 143-160 (1993) - 1991
- [j12]Yang Dai, Gerard van der Laan, A. J. J. Talman, Yoshitsugu Yamamoto:
A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron. SIAM J. Optim. 1(2): 151-165 (1991)
1980 – 1989
- 1987
- [j11]Gerard van der Laan, A. J. J. Talman:
Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds. Math. Program. 38(1): 1-15 (1987) - [j10]T. M. Doup, Gerard van der Laan, A. J. J. Talman:
The (2n+1-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria. Math. Program. 39(3): 241-252 (1987) - 1984
- [j9]Gerard van der Laan:
On the existence and approximation of zeroes. Math. Program. 28(1): 1-24 (1984) - [j8]Gerard van der Laan, L. P. Seelen:
Efficiency and implementation of simplicial zero point algorithms. Math. Program. 30(2): 196-217 (1984) - 1983
- [j7]Gerard van der Laan, A. J. J. Talman:
Interpretation of a Variable Dimension Fixed Point Algorithm with an Artificial Level. Math. Oper. Res. 8(1): 86-99 (1983) - [j6]Gerard van der Laan, A. J. J. Talman:
Note on the path following approach of equilibrium programming. Math. Program. 25(3): 363-367 (1983) - 1982
- [j5]Gerard van der Laan, A. J. J. Talman:
On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games. Math. Oper. Res. 7(1): 1-13 (1982) - 1981
- [j4]Gerard van der Laan, A. J. J. Talman:
A class of simplicial restart fixed point algorithms without an extra dimension. Math. Program. 20(1): 33-48 (1981) - 1980
- [j3]Gerard van der Laan, A. J. J. Talman:
An improvement of fixed point algorithms by using a good triangulation. Math. Program. 18(1): 274-285 (1980) - [j2]Gerard van der Laan, A. J. J. Talman:
A new subdivision for computing fixed points with a homotopy algorithm. Math. Program. 19(1): 78-91 (1980)
1970 – 1979
- 1979
- [j1]Gerard van der Laan, A. J. J. Talman:
A restart algorithm for computing fixed points without an extra dimension. Math. Program. 17(1): 74-84 (1979)
Coauthor Index
aka: A. J. J. Talman
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 2024-06-10 20:30 CEST 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:
