Awi Federgruen

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Paul J. Schweitzer

> Home > Persons > Awi Federgruen

Publications

1984
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/mor/FedergruenS84
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/FedergruenS84
Awi Federgruen, Paul J. Schweitzer:
Successive Approximation Methods for Solving Nested Functional Equations in Markov Decision Problems. Math. Oper. Res. 9(3): 319-344 (1984)
1983
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/mor/FedergruenST83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/FedergruenST83
Awi Federgruen, Paul J. Schweitzer, Henk C. Tijms:
Denumerable Undiscounted Semi-Markov Decision Processes with Unbounded Rewards. Math. Oper. Res. 8(2): 298-313 (1983)
1978
[j2]
- view
  authority control:
- export record
  dblp key:
  - journals/mor/SchweitzerF78
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/SchweitzerF78
Paul J. Schweitzer, Awi Federgruen:
The Functional Equations of Undiscounted Markov Renewal Programming. Math. Oper. Res. 3(4): 308-321 (1978)
1977
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/mor/SchweitzerF77
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mor/SchweitzerF77
Paul J. Schweitzer, Awi Federgruen:
The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision Problems. Math. Oper. Res. 2(4): 360-381 (1977)

a service of

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.