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
Keywords
Related Articles
- EP ID EP166169
- DOI 10.7494/dmms.2012.6.2.5
- Views 109
- Downloads 0
Optimizing Modular Machining Line Design Problem with Mixed Activation Mode of Machining Units
A modular transfer line designing problem is investigated. The problem is to find the best subset of modules (machining units) from a given set and to assign them to different stations so that technological constraints a...
Corrigendum to ”Neighbourhood Properties in Some Single Processor Scheduling Problem with Variable Efficiency and Additional Resources”
Amendment to [Decision Making in Manufacturing and Services, vol. 5 (1–2), 2011, pp. 5–17
Resource Management in Machine Scheduling Problems: A Survey
The paper is a survey devoted to job scheduling problems with resource allocation. We present the results available in the scientific literature for commonly used models of job processing times and job release dates, i.e...
Interval methods for computing strong Nash equilibria of continuous games
The problem of seeking strong Nash equilibria of a continuous game is considered. For some games these points cannot be found analytically, only numerically. Interval methods provide us an approach to rigorously verify t...
Ant Algorithm for AP-N Aimed at Optimization of Complex Systems
Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions an...