Gerard van der Laan

Affiliations:
  • VU University, Department of Econometrics and Tinbergen Institute, Amsterdam, The Netherlands


According to our database1, Gerard van der Laan authored at least 43 papers between 1979 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
From hierarchies to levels: new solutions for games with hierarchical structure.
Int. J. Game Theory, 2017

2016
An Owen-type value for games with two-level communication structure.
Ann. Oper. Res., 2016

2014
Independence of downstream and upstream benefits in river water allocation problems.
Soc. Choice Welf., 2014

Constrained core solutions for totally positive games with ordered players.
Int. J. Game Theory, 2014

2013
A strategic implementation of the Average Tree solution for cycle-free graph games.
J. Econ. Theory, 2013

Characterization of the Reverse Talmud bankruptcy rule by Exemption and Exclusion properties.
Eur. J. Oper. Res., 2013

Share functions for cooperative games with levels structure of cooperation.
Eur. J. Oper. Res., 2013

2011
Harsanyi power solutions for graph-restricted games.
Int. J. Game Theory, 2011

A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure.
Int. J. Game Theory, 2011

Solving discrete systems of nonlinear equations.
Eur. J. Oper. Res., 2011

2010
The average tree solution for cooperative games with communication structure.
Games Econ. Behav., 2010

An algorithm for computing the nucleolus of disjunctive non-negative additive games with an acyclic permission structure.
Eur. J. Oper. Res., 2010

2008
A fixed point theorem for discontinuous functions.
Oper. Res. Lett., 2008

The average tree solution for cycle-free graph games.
Games Econ. Behav., 2008

2007
A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems.
SIAM J. Optim., 2007

Network Formation under Heterogeneous Costs: the Multiple Group Model.
IGTR, 2007

The socially stable core in structured transferable utility games.
Games Econ. Behav., 2007

Potentials and reduced games for share functions.
Discret. Math., 2007

Computing integral solutions of complementarity problems.
Discret. Optim., 2007

2006
Refinements of Stationary Points with Applications to Noncooperative Games and Economics.
SIAM J. Optim., 2006

Solving discrete zero point problems.
Math. Program., 2006

Characterizations of the Random Order Values by Harsanyi Payoff Vectors.
Math. Methods Oper. Res., 2006

2005
The positional power of nodes in digraphs.
Soc. Choice Welf., 2005

A class of consistent share functions for games in coalition structure.
Games Econ. Behav., 2005

2002
Existence and Welfare Properties of Equilibrium in an Exchange Economy with Multiple Divisible and Indivisible Commodities and Linear Production Technologies.
J. Econ. Theory, 2002

One-Seller/Two-Buyer Markets with Buyer Externalities and (im)Perfect Competition.
IGTR, 2002

2001
Core concepts for share vectors.
Soc. Choice Welf., 2001

Existence of Balanced Simplices on Polytopes.
J. Comb. Theory A, 2001

1999
Intersection theorems on polytopes.
Math. Program., 1999

1994
An Adjustment Process for an Economy with Linear Production Technologies.
Math. Oper. Res., 1994

1993
On the existence and computation of an equilibrium in an economy with constant returns to scale production.
Ann. Oper. Res., 1993

1991
A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron.
SIAM J. Optim., 1991

1987
Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds.
Math. Program., 1987

The (2<sup>n+1</sup>-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria.
Math. Program., 1987

1984
Efficiency and implementation of simplicial zero point algorithms.
Math. Program., 1984

On the existence and approximation of zeroes.
Math. Program., 1984

1983
Note on the path following approach of equilibrium programming.
Math. Program., 1983

Interpretation of a Variable Dimension Fixed Point Algorithm with an Artificial Level.
Math. Oper. Res., 1983

1982
On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative <i>N</i> Person Games.
Math. Oper. Res., 1982

1981
A class of simplicial restart fixed point algorithms without an extra dimension.
Math. Program., 1981

1980
An improvement of fixed point algorithms by using a good triangulation.
Math. Program., 1980

A new subdivision for computing fixed points with a homotopy algorithm.
Math. Program., 1980

1979
A restart algorithm for computing fixed points without an extra dimension.
Math. Program., 1979


  Loading...