BACKGROUND Explicit consideration of anticipated regret is not part of the standard shared decision-making protocols. This pilot study aimed to compare decisions about a hypothetical surgery for breast cancer and examined whether regret is a consideration in treatment decisions. METHODS In this randomized experimental study, 184 healthy female volunteers were randomized to receive a standard ...

We prove logarithmic regret bounds that depend on the loss LT of the competitor rather than on the number T of time steps. In the general online convex optimization setting, our bounds hold for any smooth and exp-concave loss (such as the square loss or the logistic loss). This bridges the gap between theO(lnT ) regret exhibited by expconcave losses and the O( √ LT ) regret exhibited by smooth ...

We study revenue optimization learning algorithms for posted-price auctions with strategic buyers. We analyze a very broad family of monotone regret minimization algorithms for this problem, which includes the previously best known algorithm, and show that no algorithm in that family admits a strategic regret more favorable than Ω( √ T ). We then introduce a new algorithm that achieves a strate...

We consider a variant of the multiarmed bandit problem where jobs queue for service, and service rates of different servers may be unknown. We study algorithms that minimize queue-regret: the (expected) difference between the queue-lengths obtained by the algorithm, and those obtained by a “genie”-aided matching algorithm that knows exact service rates. A naive view of this problem would sugges...

This paper explores the relationship between consumers’ public self-consciousness, purchase behavior, post-purchase regret, and time-limited promotions in e-commerce. Time-limited flash sales have become a common promotion strategy e-commerce, particularly China, largest e-commerce market. Firstly, effect of self-consciousness on impulsive tendency regret is examined. Secondly, this extends sco...

We consider regret minimization in repeated games with non-convex loss functions. Minimizing the standard notion of regret is computationally intractable. Thus, we define a natural notion of regret which permits efficient optimization and generalizes offline guarantees for convergence to an approximate local optimum. We give gradient-based methods that achieve optimal regret, which in turn guar...

W model a dynamic purchase context in which a consumer is uncertain about the product’s valuation. The consumer has two purchase opportunities for the product: forward purchase in Period 1 or spot purchase in Period 2. Two forms of regret are considered: buyer’s regret over the money paid in excess of his valuation of the product when buying forward and hesitater’s regret for the lost opportuni...

When a good decision leads to a bad outcome, the experience of regret can bias subsequent choices: people are less likely to select the regret-producing alternative a second time, even when it is still objectively the best alternative (non-adaptive choice switching). The first study presented herein showed that nearly half of participants experiencing regret rejected a previous alternative they...