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 114
- Downloads 0
Neighbourhood Properties in Some Single Processor Scheduling Problem with Variable Efficiency and Additional Resources
In the paper, we consider a problem of scheduling a set of tasks on a single processor. Each task must be preprocessed before it can be started on a processor. The efficiency of preprocessing is variable, i.e., the rate...
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...
A Reference Point Method to Triple-Objective Assignment of Supporting Services in a Healthcare Institution
This paper presents an application of mixed integer programming model for op- timal allocation of workers among supporting services in a hospital. The services include logistics, inventory management, financial managemen...
Scheduling Jobs with Linear Model of Simultaneous Ageing and Learning Effects
In the paper, we introduce some new scheduling model in which learning and aging effects are both considered simultaneously. In this model the actual processing time of the jobs depends only on its position in a schedule...
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...