default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDolf Talman
Person information
- affiliation: Tilburg University, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j53]Liying Kang, Anna B. Khmelnitskaya
, Erfang Shan, Dolf Talman, Guang Zhang:
The two-step average tree value for graph and hypergraph games. Ann. Oper. Res. 323(1): 109-129 (2023)- 2021
- [j52]Liying Kang, Anna B. Khmelnitskaya, Erfang Shan, Dolf Talman, Guang Zhang:
The average tree value for hypergraph games. Math. Methods Oper. Res. 94(3): 437-460 (2021) - 2020
- [j51]Anna B. Khmelnitskaya, Özer Selçuk, Dolf Talman:
The average covering tree value for directed graph games. J. Comb. Optim. 39(2): 315-333 (2020)
2010 – 2019
- 2018
- [j50]Vyacheslav V. Kalashnikov, Adolphus J. J. Talman, Lilia Alanís-López, Nataliya I. Kalashnykova:
Extended Antipodal Theorems. J. Optim. Theory Appl. 177(2): 399-412 (2018) - 2017
- [j49]Gleb A. Koshevoy, Takamasa Suzuki, Dolf Talman:
Cooperative games with restricted formation of coalitions. Discret. Appl. Math. 218: 1-13 (2017) - [j48]Xingang Wen, Peter M. Kort, Dolf Talman:
Volume flexibility and capacity investment: a real options approach. J. Oper. Res. Soc. 68(12): 1633-1646 (2017) - 2016
- [j47]Anna B. Khmelnitskaya, Özer Selçuk, Dolf Talman:
The Shapley value for directed graph games. Oper. Res. Lett. 44(1): 143-147 (2016) - [j46]Gleb A. Koshevoy, Takamasa Suzuki, Dolf Talman:
Supermodular NTU-games. Oper. Res. Lett. 44(4): 446-450 (2016) - 2015
- [j45]A. J. J. Talman, Zaifu Yang:
An efficient multi-item dynamic auction with budget constrained bidders. Int. J. Game Theory 44(3): 769-784 (2015) - 2014
- [j44]Anna B. Khmelnitskaya, Dolf Talman:
Tree, web and average web values for cycle-free directed graph games. Eur. J. Oper. Res. 235(1): 233-246 (2014) - [j43]Tommy Andersson, Jens Gudmundsson, Dolf Talman, Zaifu Yang:
A competitive partnership formation process. Games Econ. Behav. 86: 165-177 (2014) - [j42]Gleb A. Koshevoy, Dolf Talman:
Solution concepts for games with general coalitional structure. Math. Soc. Sci. 68: 19-30 (2014) - 2013
- [j41]Tommy Andersson, C. Andersson, A. J. J. Talman:
Sets in excess demand in simple ascending auctions with unit-demand bidders. Ann. Oper. Res. 211(1): 27-36 (2013) - 2012
- [j40]Dolf Talman, Zaifu Yang:
On a Parameterized System of Nonlinear Equations with Economic Applications. J. Optim. Theory Appl. 154(2): 644-671 (2012) - 2011
- [j39]Gerard van der Laan, Dolf Talman, Zaifu Yang:
Solving discrete systems of nonlinear equations. Eur. J. Oper. Res. 214(3): 493-500 (2011) - 2010
- [j38]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) - [j37]Debasis Mishra, A. J. J. Talman:
A characterization of the average tree solution for tree games. Int. J. Game Theory 39(1-2): 105-111 (2010)
2000 – 2009
- 2009
- [j36]Dolf Talman, Zaifu Yang:
A discrete multivariate mean value theorem with applications. Eur. J. Oper. Res. 192(2): 374-381 (2009) - [j35]A. J. J. Talman, Zaifu Yang:
A constructive proof of Ky Fan's coincidence theorem. Math. Program. 118(2): 317-325 (2009) - 2008
- [j34]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) - [j33]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
- [j32]Gerard van der Laan, Dolf Talman, Zaifu Yang:
Computing integral solutions of complementarity problems. Discret. Optim. 4(3-4): 315-321 (2007) - [j31]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) - [j30]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
- [j29]Gerard van der Laan, Dolf Talman, Zaifu Yang:
Solving discrete zero point problems. Math. Program. 108(1): 127-134 (2006) - [j28]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
- [j27]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) - 2004
- [j26]A. J. J. Talman, Yoshitsugu Yamamoto:
Continuum of Zero Points of a Mapping on a Compact, Convex Set. SIAM J. Optim. 14(4): 1128-1139 (2004) - 2002
- [j25]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
- [j24]Gerard van der Laan, Dolf Talman, Zaifu Yang:
Existence of Balanced Simplices on Polytopes. J. Comb. Theory A 96(2): 288-302 (2001) - [j23]P. Jean-Jacques Herings, Dolf Talman, Zaifu Yang:
Variational Inequality Problems with a Continuum of Solutions: Existence and Computation. SIAM J. Control. Optim. 39(6): 1852-1873 (2001)
1990 – 1999
- 1999
- [j22]Gerard van der Laan, Dolf Talman, Zaifu Yang:
Intersection theorems on polytopes. Math. Program. 84(1): 25-38 (1999) - 1996
- [j21]P. Jean-Jacques Herings, Dolf Talman, Zaifu Yang:
The Computation of a Continuum of Constrained Equilibria. Math. Oper. Res. 21(3): 675-696 (1996) - 1994
- [j20]Antoon van den Elzen, Dolf Talman:
Finding a Nash equilibrium in noncooperativeN-person games by solving a sequence of linear stationary point problems. Math. Methods Oper. Res. 39(3): 365-375 (1994) - [j19]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) - [j18]Hans Kremers, Dolf Talman:
A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point. Math. Program. 63: 235-252 (1994) - 1993
- [j17]Yang Dai, Dolf Talman:
Linear Stationary Point Problems on Unbounded Polyhedra. Math. Oper. Res. 18(3): 635-644 (1993) - 1991
- [j16]Antoon van den Elzen, A. J. J. Talman:
A procedure for finding Nash equilibria in bi-matrix games. ZOR Methods Model. Oper. Res. 35(1): 27-43 (1991) - [j15]Kazuya Kamiya, A. J. J. Talman:
Simplicial Algorithm to Find Zero Points of a Function with Special Structure on a Simplotope. Math. Oper. Res. 16(3): 609-626 (1991) - [j14]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
- 1989
- [j13]A. J. J. Talman, Yoshitsugu Yamamoto:
A Simplicial Algorithm for Stationary Point Problems on Polytopes. Math. Oper. Res. 14(3): 383-399 (1989) - 1987
- [j12]T. M. Doup, A. J. J. Talman:
A Continuous Deformation Algorithm on the Product Space of Unit Simplices. Math. Oper. Res. 12(3): 485-521 (1987) - [j11]T. M. Doup, A. J. J. Talman:
A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices. Math. Program. 37(3): 319-355 (1987) - [j10]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) - [j9]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) - 1986
- [j8]David F. Shanno, A. J. J. Talman, Satoru Fujishige, Steven Nahmias, Karl Straßner, Götz Uebe:
Book reviews. Z. Oper. Research 30(3) (1986) - 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
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-10-07 21:22 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:
