This paper investigates the complexity of the min-max and min-max regret versions of the s− t min cut and min cut problems. Even if the underlying problems are closely related and both polynomial, we show that the complexity of their min-max and min-max regret versions, for a constant number of scenarios, are quite contrasted since they are respectively strongly NP-hard and polynomial. Thus, we...

We study the limit behavior and performance of no-regret dynamics in general game theoretic settings. We design protocols that achieve both good regret and equilibration guarantees in general games. In terms of arbitrary no-regret dynamics we establish a strong equivalence between them and coarse correlated equilibria. We examine structured game settings where stronger properties can be establi...

Decisions often imply trade-offs that force people to accept missing an opportunity in the past or in the future. However, it is not fully clear whether a past miss or a future miss elicits more regret. In a direct comparison, previous research had found support for the greater impact of future misses. In an experimental study with 216 participants, we replicated and extended previous research ...

We introduce the general and powerful scheme of predicting information re-use in optimization algorithms. This allows us to devise a computationally efficient algorithm for bandit convex optimization with new state-of-the-art guarantees for both Lipschitz loss functions and loss functions with Lipschitz gradients. This is the first algorithm admitting both a polynomial time complexity and a reg...

We consider the problem of undiscounted reinforcement learning in continuous state space. Regret bounds in this setting usually hold under various assumptions on the structure of the reward and transition function. Under the assumption that the rewards and transition probabilities are Lipschitz, for 1-dimensional state space a regret bound of Õ(T 3 4 ) after any T steps has been given by Ortner...

Regret over missed opportunities leads adults to take more risks. Given recent evidence that the ability to experience regret impacts decisions made by 6-year-olds, and pronounced interest in the antecedents to risk taking in adolescence, we investigated the age at which a relationship between missed opportunities and risky decision-making emerges, and whether that relationship changes at diffe...

The experience of regret rests on a counterfactual analysis of events. Previous research indicates that regret emerges at around 6 years of age, marginally later than the age at which children begin to answer counterfactual questions correctly. We hypothesized that the late emergence of regret relative to early counterfactual thinking is a result of the executive demands of simultaneously holdi...

Age differences in the associations among intensity of regret, control attributions, and intrusive thoughts were investigated (N = 122, age range = 20-87 years). Given that the opportunities to overcome regrettable behavior decline with age, older adults' attributions of low internal control were expected to serve self-protective functions and facilitate deactivation of regret. In younger adult...

Decision-related regret is a negative emotion associated with thinking about a past or future choice. The thinking component generally takes the form of a wish that things were otherwise and involves a comparison of what actually did or will take place with some better alternative--a "counterfactual thought." For predecisional (anticipated) regret, the thinking involves a mental simulation of t...

This article improves the existing proven rates of regret decay in optimal policy estimation. We give a margin-free result showing that the regret decay for estimating a within-class optimal policy is second-order for empirical risk minimizers over Donsker classes, with regret decaying at a faster rate than the standard error of an efficient estimator of the value of an optimal policy. We also ...