A New Model of Random Regret Minimization
نویسنده
چکیده
A new choice model is derived, rooted in the framework of Random Regret Minimization (RRM). The proposed model postulates that when choosing, people anticipate and aim to minimize regret. Whereas previous regret-based discrete choice-models assume that regret is experienced with respect to only the best of foregone alternatives, the proposed model assumes that regret is potentially experienced with respect to each foregone alternative that performs well. In contrast with earlier regret-based discrete-choice approaches, this model can be estimated using readily available discrete-choice software packages. The proposed model is contrasted theoretically and empirically with its natural counterpart, Random Utility Maximization’s linearadditive MNL-model. Empirical comparisons on four revealed and stated travel choice datasets show a promising performance of the RRM-model.
منابع مشابه
A Regret Minimization Approach in Product Portfolio Management with respect to Customers’ Price-sensitivity
In an uncertain and competitive environment, product portfolio management (PPM) becomes more challenging for manufacturers to decide what to make and establish the most beneficial product portfolio. In this paper, a novel approach in PPM is proposed in which the environment uncertainty, competitors’ behavior and customer’s satisfaction are simultaneously considered as the most important criteri...
متن کاملThe application of the random regret minimization model to drivers’ choice of crash avoidance maneuvers
This study explores the plausibility of regret minimization as behavioral paradigm underlying the choice of crash avoidance maneuvers. Alternatively to previous studies that considered utility maximization, this study applies the random regret minimization (RRM) model while assuming that drivers seek to minimize their anticipated regret from their corrective actions. The model accounts for driv...
متن کاملRandom Walk Approach to Regret Minimization
We propose a computationally efficient random walk on a convex body which rapidly mixes to a time-varying Gibbs distribution. In the setting of online convex optimization and repeated games, the algorithm yields low regret and presents a novel efficient method for implementing mixture forecasting strategies.
متن کاملSampling of Alternatives in Random Regret Minimization Models
Sampling of alternatives is often required in discrete choice models to reduce the computational burden and to avoid describing a large number of attributes. This approach has been used in many areas, including modeling of route choice, vehicle ownership, trip destination, residential location, and activity scheduling. The need for sampling of alternatives is accentuated for Random Regret Minim...
متن کاملRegret Minimization in Games with Incomplete Information
Extensive games are a powerful model of multiagent decision-making scenarioswith incomplete information. Finding a Nash equilibrium for very large instancesof these games has received a great deal of recent attention. In this paper, wedescribe a new technique for solving large games based on regret minimization.In particular, we introduce the notion of counterfactual regret, whi...
متن کامل