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 102
- Downloads 0
Allocating Pooled Inventory According to Contributions and Entitlements
Inventory pooling, whether by centralization of stock or by mutual assistance, is known to be beneficial when demands are uncertain. But when the retailers are independent, the question is how to divide the benefits of p...
Batch Scheduling of Deteriorating Products
In this paper we consider the problem of scheduling N jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a simple linear increasing function depending on job’s waitin...
Concept of Industry 4.0-Related Manufacturing Technology Maturity Model (ManuTech Maturity Model – MTMM)
The main objective of this article is to describe Industry 4.0 and key manufacturing-technology-related technological and business challenges for manufacturing companies. The groups especially interested in the industry...
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...
Scheduling of Identical Jobs with Bipartite Incompatibility Graphs on Uniform Machines. Computational Experiments
In the paper we consider the problem of scheduling of unit-length jobs on 3 or 4 uniform parallel machines to minimize schedule length or total completion time. We assume that jobs are subject to some kind of mutual excl...