English
Related papers

Related papers: Minimax decision rules for planning under uncertai…

200 papers

Least worst regret (and sometimes minimax) analysis are often used for decision making whenever it is difficult, or inappropriate, to attach probabilities to possible future scenarios. We show that, for each of these two approaches and…

Optimization and Control · Mathematics 2016-08-03 Stan Zachary

One way to make decisions under uncertainty is to select an optimal option from a possible range of options, by maximizing the expected utilities derived from a probability model. However, under severe uncertainty, identifying precise…

Statistics Theory · Mathematics 2024-03-06 Nawapon Nakharutai , Sébastien Destercke , Matthias C. M. Troffaes

Mechanism design has found considerable application to the construction of agent-interaction protocols. In the standard setting, the type (e.g., utility function) of an agent is not known by other agents, nor is it known by the mechanism…

Computer Science and Game Theory · Computer Science 2012-07-19 Nathanael Hyafil , Craig Boutilier

The minmax regret problem for combinatorial optimization under uncertainty can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs…

Discrete Mathematics · Computer Science 2014-09-23 Andrew Mastin , Patrick Jaillet , Sang Chin

We present an online learning analysis of minimax adaptive control for the case where the uncertainty includes a finite set of linear dynamical systems. Precisely, for each system inside the uncertainty set, we define the model-based regret…

Systems and Control · Electrical Eng. & Systems 2023-09-12 Venkatraman Renganathan , Andrea Iannelli , Anders Rantzer

Consider a setup in which a decision maker is informed about the population by a finite sample and based on that sample has to decide whether or not to apply a certain treatment. We work out finite sample minimax regret treatment rules…

Econometrics · Economics 2026-01-08 Patrik Guggenberger , Nihal Mehta , Nikita Pavlov

The parameters for a Markov Decision Process (MDP) often cannot be specified exactly. Uncertain MDPs (UMDPs) capture this model ambiguity by defining sets which the parameters belong to. Minimax regret has been proposed as an objective for…

Artificial Intelligence · Computer Science 2023-02-14 Marc Rigter , Bruno Lacerda , Nick Hawes

Optimising queries in real-world situations under imperfect conditions is still a problem that has not been fully solved. We consider finding the optimal order in which to execute a given set of selection operators under partial ignorance…

Databases · Computer Science 2015-07-30 Khaled H. Alyoubi , Sven Helmer , Peter T. Wood

In this correspondence, we introduce a minimax regret criteria to the least squares problems with bounded data uncertainties and solve it using semi-definite programming. We investigate a robust minimax least squares approach that minimizes…

Systems and Control · Computer Science 2012-03-20 Nargiz Kalantarova , Mehmet A. Donmez , Suleyman S. Kozat

I consider a class of statistical decision problems in which the policymaker must decide between two policies to maximize social welfare (e.g., the population mean of an outcome) based on a finite sample. The framework introduced in this…

Econometrics · Economics 2025-03-04 Kohei Yata

We investigate the problem of continuous-time causal estimation under a minimax criterion. Let $X^T = \{X_t,0\leq t\leq T\}$ be governed by the probability law $P_{\theta}$ from a class of possible laws indexed by $\theta \in \Lambda$, and…

Information Theory · Computer Science 2014-07-09 Albert No , Tsachy Weissman

We consider how an agent should update her beliefs when her beliefs are represented by a set P of probability distributions, given that the agent makes decisions using the minimax criterion, perhaps the best-studied and most commonly-used…

Artificial Intelligence · Computer Science 2014-01-17 Peter D Grunwald , Joseph Y Halpern

For decision making under uncertainty, min-max regret has been established as a popular methodology to find robust solutions. In this approach, we compare the performance of our solution against the best possible performance had we known…

Optimization and Control · Mathematics 2021-11-25 Marc Goerigk , Michael Hartisch

We consider the setting of iterative learning control, or model-based policy learning in the presence of uncertain, time-varying dynamics. In this setting, we propose a new performance metric, planning regret, which replaces the standard…

Machine Learning · Computer Science 2021-03-01 Naman Agarwal , Elad Hazan , Anirudha Majumdar , Karan Singh

We consider robust counterparts of uncertain combinatorial optimization problems, where the difference to the best possible solution over all scenarios is to be minimized. Such minmax regret problems are typically harder to solve than their…

Optimization and Control · Mathematics 2016-06-06 A. Chassein , M. Goerigk

The menu-dependent nature of regret-minimization creates subtleties when it is applied to dynamic decision problems. Firstly, it is not clear whether \emph{forgone opportunities} should be included in the \emph{menu}, with respect to which…

Artificial Intelligence · Computer Science 2015-06-19 Joseph Y. Halpern , Samantha Leung

We use decision theory to confront uncertainty that is sufficiently broad to incorporate "models as approximations." We presume the existence of a featured collection of what we call "structured models" that have explicit substantive…

Theoretical Economics · Economics 2022-08-22 Simone Cerreia-Vioglio , Lars Peter Hansen , Fabio Maccheroni , Massimo Marinacci

Integrated assessment models have become the primary tools for comparing climate policies that seek to reduce greenhouse gas emissions. Policy comparisons have often been performed by considering a planner who seeks to make optimal…

Econometrics · Economics 2022-01-24 Stephen J. DeCanio , Charles F. Manski , Alan H. Sanstad

Designs which are minimax in the presence of model misspecifications have been constructed so as to minimize the maximum, over classes of alternate response models, of the integrated mean squared error of the predicted values. This mean…

Statistics Theory · Mathematics 2026-03-05 Douglas P. Wiens

In this paper a class of combinatorial optimization problems is discussed. It is assumed that a feasible solution can be constructed in two stages. In the first stage the objective function costs are known while in the second stage they are…

Data Structures and Algorithms · Computer Science 2020-05-22 Marc Goerigk , Adam Kasperski , Pawel Zielinski
‹ Prev 1 2 3 10 Next ›