default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam D. Sudderth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j24]János Flesch
, Arkadi Predtetchinski, William D. Sudderth:
Discrete stop-or-go games. Int. J. Game Theory 50(2): 559-579 (2021)
2010 – 2019
- 2018
- [j23]János Flesch, Arkadi Predtetchinski, William D. Sudderth:
Simplifying optimal strategies in limsup and liminf stochastic games. Discret. Appl. Math. 251: 40-56 (2018) - [j22]János Flesch, Arkadi Predtetchinski, William D. Sudderth:
Characterization and simplification of optimal strategies in positive stochastic games. J. Appl. Probab. 55(3): 728-741 (2018) - 2017
- [j21]Rida Laraki, William D. Sudderth:
A continuity question of Dubins and Savage. J. Appl. Probab. 54(2): 462-473 (2017) - 2016
- [j20]Karel Prikry, William D. Sudderth:
Measurability of the value of a parametrized game. Int. J. Game Theory 45(3): 675-683 (2016) - [j19]William D. Sudderth:
Finitely Additive Dynamic Programming. Math. Oper. Res. 41(1): 92-108 (2016) - 2014
- [j18]William D. Sudderth:
Random walks and the number theoretic density. Stat. Methods Appl. 23(4): 477-482 (2014) - 2013
- [j17]Rida Laraki, Ashok P. Maitra, William D. Sudderth:
Two-Person Zero-Sum Stochastic Games with Semicontinuous Payoff. Dyn. Games Appl. 3(2): 162-171 (2013) - 2011
- [j16]Roger A. Purves, William D. Sudderth:
Perfect Information Games with Upper Semicontinuous Payoffs. Math. Oper. Res. 36(3): 468-473 (2011)
2000 – 2009
- 2009
- [j15]James M. Dickey, Morris L. Eaton, William D. Sudderth:
De Finetti Coherence and Logical Consistency. Notre Dame J. Formal Log. 50(2): 133-139 (2009) - 2007
- [j14]Ashok P. Maitra, William D. Sudderth:
Subgame-Perfect Equilibria for Stochastic Games. Math. Oper. Res. 32(3): 711-722 (2007) - 2004
- [j13]Rida Laraki, William D. Sudderth:
The Preservation of Continuity and Lipschitz Continuity by Optimal Reward Operators. Math. Oper. Res. 29(3): 672-685 (2004) - 2003
- [j12]Ashok P. Maitra, William D. Sudderth:
Borel stay-in-a-set games. Int. J. Game Theory 32(1): 97-108 (2003) - 2002
- [j11]Piercesare Secchi, William D. Sudderth:
Stay-in-a-set games. Int. J. Game Theory 30(4): 479-490 (2002) - [j10]Piercesare Secchi, William D. Sudderth:
N-Person stochastic games with upper semi-continuous payoffs. Int. J. Game Theory 30(4): 491-502 (2002)
1990 – 1999
- 1998
- [j9]Ashok P. Maitra, William D. Sudderth:
Finitely additive stochastic games with Borel measurable payoffs. Int. J. Game Theory 27(2): 257-267 (1998) - [j8]S. Ramakrishnan, William D. Sudderth:
Geometric Convergence of Algorithms in Gambling Theory. Math. Oper. Res. 23(3): 568-575 (1998) - 1994
- [j7]Ioannis Karatzas, Martin Shubik, William D. Sudderth:
Construction of Stationary Markov Equilibria in a Strategic Market Game. Math. Oper. Res. 19(4): 975-1006 (1994) - 1992
- [j6]Ashok P. Maitra, William D. Sudderth:
The Optimal Reward Operator in Negative Dynamic Programming. Math. Oper. Res. 17(4): 921-931 (1992)
1980 – 1989
- 1989
- [j5]William D. Sudderth, Ananda P. Weerasinghe:
Controlling a Process to a Goal in Finite Time. Math. Oper. Res. 14(3): 400-409 (1989) - 1988
- [j4]Victor C. Pestien, William D. Sudderth:
Continuous-Time Casino Problems. Math. Oper. Res. 13(2): 364-376 (1988) - 1985
- [j3]Victor C. Pestien, William D. Sudderth:
Continuous-Time Red and Black: How to Control a Diffusion to a Goal. Math. Oper. Res. 10(4): 599-611 (1985) - 1983
- [j2]William D. Sudderth:
Gambling Problems with a Limit Inferior Payoff. Math. Oper. Res. 8(2): 287-297 (1983)
1970 – 1979
- 1977
- [j1]Lester E. Dubins, William D. Sudderth:
Persistently ϵ-Optimal Strategies. Math. Oper. Res. 2(2): 125-134 (1977)
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 2025-01-20 22:49 CET 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:
