Gerard van der Laan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 42 from 42

2017

From hierarchies to levels: new solutions for games with hierarchical structureMikel Álvarez-Mozos, René van den Brink, Gerard van der Laan, O. Tejada. ijgt, 46(4):1089-1113, 2017. [doi]

2016

An Owen-type value for games with two-level communication structureRené van den Brink, Anna B. Khmelnitskaya, Gerard van der Laan. anor, 243(1-2):179-198, 2016. [doi]

2014

Independence of downstream and upstream benefits in river water allocation problemsRené van den Brink, Arantza Estévez-Fernández, Gerard van der Laan, Nigel Moes. scw, 43(1):173-194, 2014. [doi]

Constrained core solutions for totally positive games with ordered playersRené van den Brink, Gerard van der Laan, Valeri Vasil'ev. ijgt, 43(2):351-368, 2014. [doi]

2013

Characterization of the Reverse Talmud bankruptcy rule by Exemption and Exclusion propertiesRené van den Brink, Yukihiko Funaki, Gerard van der Laan. eor, 228(2):413-417, 2013. [doi]

A strategic implementation of the Average Tree solution for cycle-free graph gamesRené van den Brink, Gerard van der Laan, Nigel Moes. jet, 148(6):2737-2748, 2013. [doi]

2011

A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structureRené van den Brink, Ilya Katsev, Gerard van der Laan. ijgt, 40(3):591-616, 2011. [doi]

Harsanyi power solutions for graph-restricted gamesRené van den Brink, Gerard van der Laan, Vitaly Pruzhansky. ijgt, 40(1):87-110, 2011. [doi]

Solving discrete systems of nonlinear equationsGerard van der Laan, Dolf Talman, Zaifu Yang. eor, 214(3):493-500, 2011. [doi]

2010

The average tree solution for cooperative games with communication structureP. Jean-Jacques Herings, Gerard van der Laan, A. J. J. Talman, Zaifu Yang. geb, 68(2):626-633, 2010. [doi]

An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structureRené van den Brink, Ilya Katsev, Gerard van der Laan. eor, 207(2):817-826, 2010. [doi]

2008

A fixed point theorem for discontinuous functionsP. Jean-Jacques Herings, Gerard van der Laan, Dolf Talman, Zaifu Yang. orl, 36(1):89-93, 2008. [doi]

The average tree solution for cycle-free graph gamesP. Jean-Jacques Herings, Gerard van der Laan, Dolf Talman. geb, 62(1):77-92, 2008. [doi]

2007

The socially stable core in structured transferable utility gamesP. Jean-Jacques Herings, Gerard van der Laan, Dolf Talman. geb, 59(1):85-104, 2007. [doi]

Network Formation under Heterogeneous Costs: the Multiple Group ModelJurjen Kamphorst, Gerard van der Laan. igtr, 9(4):599-635, 2007. [doi]

Potentials and reduced games for share functionsRené van den Brink, Gerard van der Laan. DM, 307(19-20):2385-2399, 2007. [doi]

Computing integral solutions of complementarity problemsGerard van der Laan, Dolf Talman, Zaifu Yang. disopt, 4(3-4):315-321, 2007. [doi]

A Vector Labeling Method for Solving Discrete Zero Point and Complementarity ProblemsGerard van der Laan, Dolf Talman, Zaifu Yang. siamjo, 18(1):290-308, 2007. [doi]

2006

Characterizations of the Random Order Values by Harsanyi Payoff VectorsJean Derks, Gerard van der Laan, Valery Vasil'ev. mmor, 64(1):155-163, 2006. [doi]

Solving discrete zero point problemsGerard van der Laan, Dolf Talman, Zaifu Yang. mp, 108(1):127-134, 2006. [doi]

Refinements of Stationary Points with Applications to Noncooperative Games and EconomicsGerard van der Laan, Dolf Talman, Zaifu Yang. siamjo, 16(3):854-870, 2006. [doi]

2005

The positional power of nodes in digraphsP. Jean-Jacques Herings, Gerard van der Laan, Dolf Talman. scw, 24(3):439-454, 2005. [doi]

A class of consistent share functions for games in coalition structureRené van den Brink, Gerard van der Laan. geb, 51(1):193-212, 2005. [doi]

2002

Existence and Welfare Properties of Equilibrium in an Exchange Economy with Multiple Divisible and Indivisible Commodities and Linear Production TechnologiesGerard van der Laan, Dolf Talman, Zaifu Yang. jet, 103(2):411-428, 2002. [doi]

One-Seller/Two-Buyer Markets with Buyer Externalities and (im)Perfect CompetitionGerard van der Laan, Harold Houba. igtr, 4(2):141-164, 2002. [doi]

2001

Core concepts for share vectorsRené van den Brink, Gerard van der Laan. scw, 18(4):759-784, 2001. [doi]

Existence of Balanced Simplices on PolytopesGerard van der Laan, Dolf Talman, Zaifu Yang. JCT, 96(2):288-302, 2001. [doi]

1999

Intersection theorems on polytopesGerard van der Laan, Dolf Talman, Zaifu Yang. mp, 84(1):25-38, 1999. [doi]

1994

An Adjustment Process for an Economy with Linear Production TechnologiesAntoon van den Elzen, Gerard van der Laan, Dolf Talman. mor, 19(2):341-351, 1994. [doi]

1993

On the existence and computation of an equilibrium in an economy with constant returns to scale productionGerard van der Laan, Hans Kremers. anor, 44(2):143-160, 1993. [doi]

1991

A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded PolyhedronYang Dai, Gerard van der Laan, A. J. J. Talman, Yoshitsugu Yamamoto. siamjo, 1(2):151-165, 1991. [doi]

1987

n+1-2)-ray algorithm: A new simplicial algorithm to compute economic equilibriaT. M. Doup, Gerard van der Laan, A. J. J. Talman. mp, 39(3):241-252, 1987. [doi]

Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper boundsGerard van der Laan, A. J. J. Talman. mp, 38(1):1-15, 1987. [doi]

1984

Efficiency and implementation of simplicial zero point algorithmsGerard van der Laan, L. P. Seelen. mp, 30(2):196-217, 1984. [doi]

On the existence and approximation of zeroesGerard van der Laan. mp, 28(1):1-24, 1984. [doi]

1983

Note on the path following approach of equilibrium programmingGerard van der Laan, A. J. J. Talman. mp, 25(3):363-367, 1983. [doi]

Interpretation of a Variable Dimension Fixed Point Algorithm with an Artificial LevelGerard van der Laan, A. J. J. Talman. mor, 8(1):86-99, 1983. [doi]

1982

N Person GamesGerard van der Laan, A. J. J. Talman. mor, 7(1):1-13, 1982. [doi]

1981

A class of simplicial restart fixed point algorithms without an extra dimensionGerard van der Laan, A. J. J. Talman. mp, 20(1):33-48, 1981. [doi]

1980

An improvement of fixed point algorithms by using a good triangulationGerard van der Laan, A. J. J. Talman. mp, 18(1):274-285, 1980. [doi]

A new subdivision for computing fixed points with a homotopy algorithmGerard van der Laan, A. J. J. Talman. mp, 19(1):78-91, 1980. [doi]

1979

A restart algorithm for computing fixed points without an extra dimensionGerard van der Laan, A. J. J. Talman. mp, 17(1):74-84, 1979. [doi]

Sign in or sign up to see more results.

runs on WebDSL