A representation theorem for minmax regret policies

Artificial Intelligence 171 (1):19-24 (2007)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2006.11.001

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,891

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

No regrets about no-regret.Yu-Han Chang - 2007 - Artificial Intelligence 171 (7):434-439.
Generalized regret based decision making.Ronald R. Yager - 2017 - Engineering Applications of Artificial Intelligence 65:400-405.
Regret minimization in online Bayesian persuasion: Handling adversarial receiver's types under full and partial feedback models.Matteo Castiglioni, Andrea Celli, Alberto Marchesi & Nicola Gatti - 2023 - Artificial Intelligence 314 (C):103821.
A theorem on the consistency of circumscription.Peter L. Mott - 1987 - Artificial Intelligence 31 (1):87-98.
Theorem proving with abstraction.David A. Plaisted - 1981 - Artificial Intelligence 16 (1):47-108.
A circumscriptive theorem prover.Matthew L. Ginsberg - 1989 - Artificial Intelligence 39 (2):209-230.
The last player theorem.Dana S. Nau - 1982 - Artificial Intelligence 18 (1):53-65.
Analytic resolution in theorem proving.D. Brand - 1976 - Artificial Intelligence 7 (4):285-318.
Non-resolution theorem proving.W. W. Bledsoe - 1977 - Artificial Intelligence 9 (1):1-35.
An examination of the geometry theorem machine.P. C. Gilmore - 1970 - Artificial Intelligence 1 (3-4):171-187.

Analytics

Added to PP
2020-12-22

Downloads
1 (#1,919,186)

6 months
1 (#1,722,086)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Add more references