Competitive location under proportional choice: 1-suboptimal points on networks
Journal Title: Decision Making in Manufacturing and Services - Year 2012, Vol 6, Issue 1
Abstract
This paper is concerned with a competitive or voting location problem on networks under a proportional choice rule that has previously been introduced by Bauer et al. (1993). We refine a discretization result of the authors by proving convexity and concavity properties of related expected payoff functions. Furthermore, we answer the long time open question whether 1-suboptimal points are always vertices by providing a counterexample on a tree network.
Authors and Affiliations
Erwin Pesch, Dominik Kress
Corrigendum to ”Extended Model Formulation of the Proportional Lot-Sizing and Scheduling Problem with Lost Demand Costs”
Amendment to Decision Making in Manufacturing and Services, vol. 5 (1–2), 2011, pp. 49–56
A multi-criteria optimization approach to modeling negotiation process
The paper presents a multi-criteria optimization approach to modeling negotiation process. The negotiation process is modeled as a special multi-criteria problem. The method for finding solutions is the interactive selec...
On Public Values and Power Indices
In this paper we analyze, from a different point of view, some values and power indices well defined in the social context where the goods are public. In particular we consider the Public Good index (Holler, 1982), the P...
Models and Tools for Improving Efficiency in Constraint Logic Programming
Constraint Satisfaction Problems typically exhibit strong combinatorial explosion. In this paper we present some models and techniques aimed at improving efficiency in Constraint Logic Programming. A hypergraph model of...
A Utility Function to Solve Approximate Linear Equations for Decision Making
Suppose there are a number of decision variables linearly related to a set of outcome variables. There are at least as many outcome variables as the number of decision variables since all decisions are outcomes by themse...