Concept

Théorie du regret

Publications associées (39)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Time-Varying Gaussian Process Bandit Optimization

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic

We consider the sequential Bayesian optimization problem with bandit feedback, adopting a formulation that allows for the reward function to vary with time. We model the reward function using a Gaussian process whose evolution obeys a simple Markov model. ...

2016

A mixed random utility Random regret model linking the choice of decision rule to latent character traits

Amanda Blomberg Stathopoulos

An increasing number of studies are concerned with the use of alternatives to random utility maximisation as a decision rule in choice models, with a particular emphasis on regret minimisation over the last few years. The initial focus was on revealing whi ...

2013

Selfish Response to Epidemic Propagation

Jean-Yves Le Boudec, Georgios Theodorakopoulos

An epidemic spreading in a network calls for a decision on the part of the network members: They should decide whether to protect themselves or not. Their decision depends on the trade-off between their perceived risk of being infected and the cost of bein ...

Institute of Electrical and Electronics Engineers2013

An empirical comparison of travel choice models that capture preferences for compromise alternatives

Michel Bierlaire

Compromise alternatives have an intermediate performance on each or most attributes rather than having a poor performance on some attributes and a strong performance on others. The relative popularity of compromise alternatives among decision-makers has be ...

Springer2013

Inference about the number of contributors to a DNA mixture: Comparative analyses of a Bayesian network approach and the maximum allele count method

Kjell Konis

In the forensic examination of DNA mixtures, the question of how to set the total number of contributors (N) presents a topic of ongoing interest. Part of the discussion gravitates around issues of bias, in particular when assessments of the number of cont ...

Elsevier2012

In the standard real options approach to investment under uncertainty, agents formulate optimal policies under the assumptions of risk neutrality or complete financial markets. Although these assumptions are crucial to the implications of the approach, the ...

2012

Selfish Response to Epidemic Propagation

Jean-Yves Le Boudec, Georgios Theodorakopoulos

An epidemic spreading in a network calls for a decision on the part of the network members: They should decide whether to protect themselves or not. Their decision depends on the trade off between their perceived risk of being infected and the cost of bein ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Multimodel Structural Performance Monitoring

Ian Smith, James-Alexandre Goulet

Measurements from load tests may lead to numerical models that better reflect structural behavior. This kind of system identification is not straightforward due to important uncertainties in measurement and models. Moreover, since system identification is ...

2010

A Behavioral and Neural Evaluation of Prospective Decision-Making under Risk

Making the best choice when faced with a chain of decisions requires a person to judge both anticipated outcomes and future actions. Although economic decision-making models account for both risk and reward in single-choice contexts, there is a dearth of s ...

2010

A Parallel Algorithm for Solving Large Convex Minimax Problems

Utkarsh Upadhyay, Ramnik Arora

We consider unconstrained minimax problem where the objective function is the maximum of a finite number of smooth convex functions. We present an iterative method to compute the optimal solution for the unconstrained convex finite minimax problem. The alg ...

Springer2010