Regret in the on-line decision problem
type: Item
instance of: scholarly article
title: Regret in the on-line decision problem
zbMATH Open document ID: 0984.91025
author: Dean P. Foster
author: Rakesh V. Vohra
published in: Games and Economic Behavior
publication date: 2001-05-02T00:00:00Z
full work available at URL: refs4569.pdf
review text: The paper deals with a specific type of the decision making sequences. It assumed that a decision-maker makes a time sequence of decisions, and his final loss depends on the accepted decision as well as on the actual state of the world. Moreover, in the time of the decision making the agent has no information about the state of the world. His aim is to minimize the total loss. A basic concept of the presented model is the one of the ``regret'' which characterizes the difference between the loss following after some decision, and the expected loss connected with an alternative decision making strategy. The main results formulate the properties of the regret and its relation to the optimal decision making.
reviewed by: Milan Mareš
Mathematics Subject Classification ID: 91B06
zbMATH DE Number: 1383769
zbMATH Keywords: uncertaint
zbMATH Keywords: regret
zbMATH Keywords: decision making
zbMATH Keywords: actual state of the world
describes a project that uses: AdaBoost.MH
MaRDI profile type: Publication
OpenAlex ID: W2135730283
cites work: Q4252717
cites work: On Pseudo-Games
cites work: Q3234879
cites work: An analog of the minimax theorem for vector payoffs
cites work: How to use expert advice
cites work: Universal Portfolios
cites work: Choice Without Beliefs
cites work: Universal prediction of individual sequences
cites work: Prediction in the worst case
cites work: A Randomization Rule for Selecting Forecasts
cites work: Asymptotic calibration
cites work: Calibrated learning and correlated equilibrium
cites work: Consistency and cautious fictitious play
cites work: An easier way to calibrate.
cites work: Conditional universal consistency.
cites work: Q3245635
cites work: A Simple Adaptive Procedure Leading to Correlated Equilibrium
cites work: Q3002852
cites work: The weighted majority algorithm
cites work: On repeated games with incomplete information played by non-Bayesian players
cites work: Weak Approachability
DOI: 10.1006/GAME.1999.0740
description: scientific article; zbMATH DE number 1383769