A restart algorithm for computing fixed points without an extra dimension. - Gerard van der Laan; A. J. J. Talman (Math. Program., 1979)

A new subdivision for computing fixed points with a homotopy algorithm. - Gerard van der Laan; A. J. J. Talman (Math. Program., 1980)

An improvement of fixed point algorithms by using a good triangulation. - Gerard van der Laan; A. J. J. Talman (Math. Program., 1980)

A class of simplicial restart fixed point algorithms without an extra dimension. - Gerard van der Laan; A. J. J. Talman (Math. Program., 1981)

On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games. - Gerard van der Laan; A. J. J. Talman (Math. Oper. Res., 1982)

Interpretation of a Variable Dimension Fixed Point Algorithm with an Artificial Level. - Gerard van der Laan; A. J. J. Talman (Math. Oper. Res., 1983)

Note on the path following approach of equilibrium programming. - Gerard van der Laan; A. J. J. Talman (Math. Program., 1983)

Book reviews. - David F. Shanno; A. J. J. Talman; Satoru Fujishige; Steven Nahmias; Karl Straßner; Götz Uebe (Z. Oper. Research, 1986)

A Continuous Deformation Algorithm on the Product Space of Unit Simplices. - T. M. Doup; A. J. J. Talman (Math. Oper. Res., 1987)

The (2n+1-2)-ray algorithm: A new simplicial algorithm to compute economic equilibria. - T. M. Doup; Gerard van der Laan; A. J. J. Talman (Math. Program., 1987)

A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices. - T. M. Doup; A. J. J. Talman (Math. Program., 1987)

Simplicial approximation of solutions to the nonlinear complementarity problem with lower and upper bounds. - Gerard van der Laan; A. J. J. Talman (Math. Program., 1987)

A Simplicial Algorithm for Stationary Point Problems on Polytopes. - A. J. J. Talman; Yoshitsugu Yamamoto (Math. Oper. Res., 1989)

A procedure for finding Nash equilibria in bi-matrix games. - Antoon van den Elzen; A. J. J. Talman (ZOR Methods Model. Oper. Res., 1991)

Simplicial Algorithm to Find Zero Points of a Function with Special Structure on a Simplotope. - Kazuya Kamiya; A. J. J. Talman (Math. Oper. Res., 1991)

A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron. - Yang Dai; Gerard van der Laan; A. J. J. Talman; Yoshitsugu Yamamoto (SIAM J. Optim., 1991)

Linear Stationary Point Problems on Unbounded Polyhedra. - Yang Dai; Dolf Talman (Math. Oper. Res., 1993)

Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems. - Antoon van den Elzen; Dolf Talman (Math. Methods Oper. Res., 1994)

An Adjustment Process for an Economy with Linear Production Technologies. - Antoon van den Elzen; Gerard van der Laan; Dolf Talman (Math. Oper. Res., 1994)

A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point. - Hans Kremers; Dolf Talman (Math. Program., 1994)

The Computation of a Continuum of Constrained Equilibria. - P. Jean-Jacques Herings; Dolf Talman; Zaifu Yang (Math. Oper. Res., 1996)

Intersection theorems on polytopes. - Gerard van der Laan; Dolf Talman; Zaifu Yang (Math. Program., 1999)

Existence of Balanced Simplices on Polytopes. - Gerard van der Laan; Dolf Talman; Zaifu Yang (J. Comb. Theory A, 2001)

Variational Inequality Problems with a Continuum of Solutions: Existence and Computation. - P. Jean-Jacques Herings; Dolf Talman; Zaifu Yang (SIAM J. Control. Optim., 2001)

Existence and Welfare Properties of Equilibrium in an Exchange Economy with Multiple Divisible and Indivisible Commodities and Linear Production Technologies. - Gerard van der Laan; Dolf Talman; Zaifu Yang (J. Econ. Theory, 2002)

Continuum of Zero Points of a Mapping on a Compact, Convex Set. - A. J. J. Talman; Yoshitsugu Yamamoto (SIAM J. Optim., 2004)

The positional power of nodes in digraphs. - P. Jean-Jacques Herings; Gerard van der Laan; Dolf Talman (Soc. Choice Welf., 2005)

Solving discrete zero point problems. - Gerard van der Laan; Dolf Talman; Zaifu Yang (Math. Program., 2006)

Refinements of Stationary Points with Applications to Noncooperative Games and Economics. - Gerard van der Laan; Dolf Talman; Zaifu Yang (SIAM J. Optim., 2006)

Computing integral solutions of complementarity problems. - Gerard van der Laan; Dolf Talman; Zaifu Yang (Discret. Optim., 2007)

The socially stable core in structured transferable utility games. - P. Jean-Jacques Herings; Gerard van der Laan; Dolf Talman (Games Econ. Behav., 2007)

A Vector Labeling Method for Solving Discrete Zero Point and Complementarity Problems. - Gerard van der Laan; Dolf Talman; Zaifu Yang (SIAM J. Optim., 2007)

The average tree solution for cycle-free graph games. - P. Jean-Jacques Herings; Gerard van der Laan; Dolf Talman (Games Econ. Behav., 2008)

A fixed point theorem for discontinuous functions. - P. Jean-Jacques Herings; Gerard van der Laan; Dolf Talman; Zaifu Yang (Oper. Res. Lett., 2008)

A discrete multivariate mean value theorem with applications. - Dolf Talman; Zaifu Yang (Eur. J. Oper. Res., 2009)

A constructive proof of Ky Fan's coincidence theorem. - A. J. J. Talman; Zaifu Yang (Math. Program., 2009)

The average tree solution for cooperative games with communication structure. - P. Jean-Jacques Herings; Gerard van der Laan; A. J. J. Talman; Zaifu Yang (Games Econ. Behav., 2010)

A characterization of the average tree solution for tree games. - Debasis Mishra; A. J. J. Talman (Int. J. Game Theory, 2010)

Solving discrete systems of nonlinear equations. - Gerard van der Laan; Dolf Talman; Zaifu Yang (Eur. J. Oper. Res., 2011)

On a Parameterized System of Nonlinear Equations with Economic Applications. - Dolf Talman; Zaifu Yang (J. Optim. Theory Appl., 2012)

Sets in excess demand in simple ascending auctions with unit-demand bidders. - Tommy Andersson; C. Andersson; A. J. J. Talman (Ann. Oper. Res., 2013)

Tree, web and average web values for cycle-free directed graph games. - Anna B. Khmelnitskaya; Dolf Talman (Eur. J. Oper. Res., 2014)

A competitive partnership formation process. - Tommy Andersson; Jens Gudmundsson; Dolf Talman; Zaifu Yang (Games Econ. Behav., 2014)

Solution concepts for games with general coalitional structure. - Gleb A. Koshevoy; Dolf Talman (Math. Soc. Sci., 2014)

An efficient multi-item dynamic auction with budget constrained bidders. - A. J. J. Talman; Zaifu Yang (Int. J. Game Theory, 2015)

The Shapley value for directed graph games. - Anna B. Khmelnitskaya; Özer Selçuk; Dolf Talman (Oper. Res. Lett., 2016)

Supermodular NTU-games. - Gleb A. Koshevoy; Takamasa Suzuki; Dolf Talman (Oper. Res. Lett., 2016)

Cooperative games with restricted formation of coalitions. - Gleb A. Koshevoy; Takamasa Suzuki; Dolf Talman (Discret. Appl. Math., 2017)

Volume flexibility and capacity investment: a real options approach. - Xingang Wen; Peter M. Kort; Dolf Talman (J. Oper. Res. Soc., 2017)

Extended Antipodal Theorems. - Vyacheslav V. Kalashnikov; Adolphus J. J. Talman; Lilia Alanís-López; Nataliya I. Kalashnykova (J. Optim. Theory Appl., 2018)

The average covering tree value for directed graph games. - Anna B. Khmelnitskaya; Özer Selçuk; Dolf Talman (J. Comb. Optim., 2020)

The average tree value for hypergraph games. - Liying Kang; Anna B. Khmelnitskaya; Erfang Shan; Dolf Talman; Guang Zhang (Math. Methods Oper. Res., 2021)

The two-step average tree value for graph and hypergraph games. - Liying Kang; Anna B. Khmelnitskaya; Erfang Shan; Dolf Talman; Guang Zhang (Ann. Oper. Res., 2023)