WGWalter J. Gutjahr

Walter J. Gutjahr

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Walter J. Gutjahr has a total of 76 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    How much harder are indifference adjustments? An experiment on the cognitive effort in multi-criteria decisions

    by Wolfgang Haidinger, Florian A.D. Burnat, Juergen Branke, Walter J. Gutjahr

  • Open Access

    Age-based equitable health resource allocation and the fair innings argument

    by Walter J. Gutjahr

    The paper addresses the efficient and fair allocation of limited healthcare resources to patient groups, with a special focus on the consideration of patients’ age in the allocation decision. At the core of this issue lies the controversially discussed “fair innings argument” which suggests a prioritization of younger patients over older ones. Recently, Adler (J Health Econ 75:102412, 2021) developed a rigorous theoretical framework for the fair innings concept, building on a prioritarian social welfare function. The first goal of the present work is to recast this prioritarian framework to an egalitarian one by employing a social welfare function based on the Gini index. Some theoretical properties related to the “social value of risk reduction” are derived. Secondly, as an example of application, it is shown how the egalitarian framework can be used to set up an optimization model for vaccination policies against epidemics. Third, an alternative for healthcare decision makers who reject the fair innings argument is offered by proposing a variant of the egalitarian model which builds on the idea of “deontic fairness” by Parfit (Equality or priority?, University of Kansas, Lawrence, 1995). Numerical results on a small case study are presented and compared.


  • Risk-Averse Bargaining in a Stochastic Optimization Context

    by Walter J. Gutjahr, Raimund M. Kovacevic, David Wozabal

    Problem definition: Bargaining situations are ubiquitous in economics and management. We consider the problem of bargaining for a fair ex ante distribution of random profits arising from a cooperative effort of a fixed set of risk-averse agents. Our approach integrates optimal managerial decision making into bargaining situations with random outcomes and explicitly models the impact of risk aversion. The proposed solution rests on a firm axiomatic foundation and yet allows to compute concrete bargaining solutions for a wide range of practically relevant problems. Methodology/results: We model risk preferences using coherent acceptability functionals and base our bargaining solution on a set of axioms that can be considered a natural extension of Nash bargaining to our setting. We show that the proposed axioms fully characterize a bargaining solution, which can be efficiently computed by solving a stochastic optimization problem. We characterize special cases where random payoffs of players are simple functions of overall project profit. In particular, we show that, for players with distortion risk functionals, the optimal bargaining solution can be represented by an exchange of standard options contracts with the project profit as the underlying asset. We illustrate the concepts in the paper with a detailed example of risk-averse households that jointly invest into a solar plant. Managerial implications: We demonstrate that there is no conflict of interest between players about management decisions and that risk aversion facilitates cooperation. Furthermore, our results on the structure of optimal contracts as a basket of option contracts provides valuable guidance for negotiators.


  • Open Access

    Bi-objective facility location under uncertainty with an application in last-mile disaster relief

    by Najmesadat Nazemi, Sophie N. Parragh, Walter J. Gutjahr

    Multiple and usually conflicting objectives subject to data uncertainty are main features in many real-world problems. Consequently, in practice, decision-makers need to understand the trade-off between the objectives, considering different levels of uncertainty in order to choose a suitable solution. In this paper, we consider a two-stage bi-objective single source capacitated model as a base formulation for designing a last-mile network in disaster relief where one of the objectives is subject to demand uncertainty. We analyze scenario-based two-stage risk-neutral stochastic programming, adaptive (two-stage) robust optimization, and a two-stage risk-averse stochastic approach using conditional value-at-risk (CVaR). To cope with the bi-objective nature of the problem, we embed these concepts into two criterion space search frameworks, the $$\epsilon $$ ϵ -constraint method and the balanced box method, to determine the Pareto frontier. Additionally, a matheuristic technique is developed to obtain high-quality approximations of the Pareto frontier for large-size instances. In an extensive computational experiment, we evaluate and compare the performance of the applied approaches based on real-world data from a Thies drought case, Senegal.


  • Open Access

    A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem

    by Sophie N. Parragh, Fabien Tricoire, Walter J. Gutjahr

    In many real-world optimization problems, more than one objective plays a role and input parameters are subject to uncertainty. In this paper, motivated by applications in disaster relief and public facility location, we model and solve a bi-objective stochastic facility location problem. The considered objectives are cost and covered demand, where the demand at the different population centers is uncertain but its probability distribution is known. The latter information is used to produce a set of scenarios. In order to solve the underlying optimization problem, we apply a Benders’ type decomposition approach which is known as the L-shaped method for stochastic programming and we embed it into a recently developed branch-and-bound framework for bi-objective integer optimization. We analyze and compare different cut generation schemes and we show how they affect lower bound set computations, so as to identify the best performing approach. Finally, we compare the branch-and-Benders-cut approach to a straight-forward branch-and-bound implementation based on the deterministic equivalent formulation.


  • Innovative approaches in humanitarian operations

    by Walter J. Gutjahr, Nilay Noyan, Nico Vandaele, Luk N. Van Wassenhove


  • Open Access

    A branch-and-Benders-cut algorithm for a bi-objective stochastic facility location problem

    by Sophie N. Parragh, Fabien Tricoire, Walter Gutjahr

    In many real-world optimization problems, more than one objective plays a role and input parameters are subject to uncertainty. In this paper, motivated by applications in disaster relief and public facility location, we model and solve a bi-objective stochastic facility location problem. The considered objectives are cost and uncovered demand, whereas the demand at the different population centers is uncertain but its probability distribution is known. The latter information is used to produce a set of scenarios. In order to solve the underlying optimization problem, we apply a Benders' type decomposition approach which is known as the L-shaped method for stochastic programming and we embed it into a recently developed branch-and-bound framework for bi-objective integer optimization. We analyze and compare different cut generation schemes and we show how they affect lower bound set computations, so as to identify the best performing approach. Finally, we compare the branch-and-Benders-cut approach to a straight-forward branch-and-bound implementation based on the deterministic equivalent formulation.