The following pages link to Gerard van der Laan (Q224905):
Displayed 45 items.
- Computing integral solutions of complementarity problems (Q2427691) (← links)
- Stationary points and equilibria (Q2431378) (← links)
- A strategic implementation of the average tree solution for cycle-free graph games (Q2434245) (← links)
- An efficient and fair solution for communication graph games (Q2440450) (← links)
- Constrained core solutions for totally positive games with ordered players (Q2453492) (← links)
- The average tree solution for cycle-free graph games (Q2483116) (← links)
- A class of consistent share functions for games in coalition structure (Q2486158) (← links)
- Solving discrete zero point problems (Q2494512) (← links)
- The positional power of nodes in digraphs (Q2575412) (← links)
- Axiomatic analysis of liability problems with rooted-tree networks in tort law (Q2683485) (← links)
- On the existence and approximation of zeroes (Q3319694) (← links)
- (Q3354422) (← links)
- (Q3471796) (← links)
- (Q3471797) (← links)
- NETWORK FORMATION UNDER HETEROGENEOUS COSTS: THE MULTIPLE GROUP MODEL (Q3502850) (← links)
- The Computation of General Equilibrium in Economies with a Block Diagonal Pattern (Q3686380) (← links)
- Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds (Q3771993) (← links)
- The (2 n+1−2)-ray algorithm: A new simplicial algorithm to compute economic equilibria (Q3780017) (← links)
- Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling (Q3780024) (← links)
- An improvement of fixed point algorithms by using a good triangulation (Q3872238) (← links)
- A new subdivision for computing fixed points with a homotopy algorithm (Q3880620) (← links)
- Equilibrium under Rigid Prices with Compensation for the Consumers (Q3882143) (← links)
- A class of simplicial restart fixed point algorithms without an extra dimension (Q3883945) (← links)
- (Q3893221) (← links)
- (Q3896413) (← links)
- (Q3911288) (← links)
- (Q3916368) (← links)
- (Q3916369) (← links)
- Note on the path following approach of equilibrium programming (Q3962743) (← links)
- On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative <i>N</i> Person Games (Q3962794) (← links)
- A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron (Q4012418) (← links)
- A restart algorithm for computing fixed points without an extra dimension (Q4198344) (← links)
- Existence and Approximation of Robust Solutions of Variational Inequality Problems over Polytopes (Q4252990) (← links)
- (Q4257469) (← links)
- An Adjustment Process for an Economy with Linear Production Technologies (Q4302592) (← links)
- (Q4524796) (← links)
- (Q4704802) (← links)
- Interpretation of a Variable Dimension Fixed Point Algorithm with an Artificial Level (Q4744076) (← links)
- ONE-SELLER/TWO-BUYER MARKETS WITH BUYER EXTERNALITIES AND (IM)PERFECT COMPETITION (Q4797299) (← links)
- (Q4811618) (← links)
- Efficiency and implementation of simplicial zero point algorithms (Q5186644) (← links)
- A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems (Q5444292) (← links)
- Refinements of Stationary Points with Applications to Noncooperative Games and Economics (Q5470222) (← links)
- Existence of balanced simplices on polytopes. (Q5953376) (← links)
- (Q6135999) (← links)