Adjustable Robust Optimization Reformulations of Two-Stage Worst-Case Regret Minimization Problems

Although the stochastic optimization paradigm exploits probability theory to optimize the tradeoff between risk and returns, robust optimization has gained significant popularity by reducing computation requirements through the optimization of the worst-case scenario in a set. An appealing alternative to stochastic and robust optimization consists in optimizing decisions using the notion of regret. Although regret minimization models are generally perceived as leading to less conservative decisions than those produced by robust optimization, their numerical optimization is a real challenge in general. In “Adjustable Robust Optimization Reformulations of Two-Stage Worst-case Regret Minimization Problems,” M. Poursoltani and E. Delage show how to reduce a two-stage worst-case absolute/relative regret minimization problem to a two-stage robust optimization one. This opens the way for taking advantage of recent advanced approximate and exact solution schemes for these hard problems. Their experiments corroborate the high-quality performance of affine decision rules as a popular polynomial-time approximation scheme, from which, under mild conditions, one can even expect exact regret-averse decisions.

randregret: A command for fitting random regret minimization models using Stata

In this article, we describe the randregret command, which implements a variety of random regret minimization (RRM) models. The command allows the user to apply the classic RRM model introduced in Chorus (2010, European Journal of Transport and Infrastructure Research 10: 181–196), the generalized RRM model introduced in Chorus (2014, Transportation Research, Part B 68: 224–238), and also the µRRM and pure RRM models, both introduced in van Cranenburgh, Guevara, and Chorus (2015, Transportation Research, Part A 74: 91–109). We illustrate the use of the randregret command by using stated choice data on route preferences. The command offers robust and cluster standarderror correction using analytical expressions of the score functions. It also offers likelihood-ratio tests that can be used to assess the relevance of a given model specification. Finally, users can obtain the predicted probabilities from each model by using the randregretpred command.

CFR-MIX: Solving Imperfect Information Extensive-Form Games with Combinatorial Action Space

In many real-world scenarios, a team of agents must coordinate with each other to compete against an opponent. The challenge of solving this type of game is that the team's joint action space grows exponentially with the number of agents, which results in the inefficiency of the existing algorithms, e.g., Counterfactual Regret Minimization (CFR). To address this problem, we propose a new framework of CFR: CFR-MIX. Firstly, we propose a new strategy representation that represents a joint action strategy using individual strategies of all agents and a consistency relationship to maintain the cooperation between agents. To compute the equilibrium with individual strategies under the CFR framework, we transform the consistency relationship between strategies to the consistency relationship between the cumulative regret values. Furthermore, we propose a novel decomposition method over cumulative regret values to guarantee the consistency relationship between the cumulative regret values. Finally, we introduce our new algorithm CFR-MIX which employs a mixing layer to estimate cumulative regret values of joint actions as a non-linear combination of cumulative regret values of individual actions. Experimental results show that CFR-MIX outperforms existing algorithms on various games significantly.

Values of Travel Time for Recreational Trips under Different Behavioural Rules

In this study, discrete choice models that combine different behavioural rules are estimated to study the visitors’ preferences in relation to their travel mode choices to access a national park. Using a revealed preference survey conducted on visitors of Teide National Park (Tenerife, Spain), we present a hybrid model specification—with random parameters—in which we assume that some attributes are evaluated by the individuals under conventional random utility maximization (RUM) rules, whereas others are evaluated under random regret minimization (RRM) rules. We then compare the results obtained using exclusively a conventional RUM approach to those obtained using both RUM and RRM approaches, derive monetary valuations of the different components of travel time and calculate direct elasticity measures. Our results provide useful instruments to evaluate policies that promote the use of more sustainable modes of transport in natural sites. Such policies should be considered as priorities in many national parks, where negative transport externalities such as traffic congestion, pollution, noise and accidents are causing problems that jeopardize not only the sustainability of the sites, but also the quality of the visit.