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 101
- Downloads 0
Competitive location under proportional choice: 1-suboptimal points on networks
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 auth...
BPMN – A Logical Model and Property Analysis
Business Process Modeling Notation has become a powerful and widely accepted visual language for modeling business processes. Despite its expressive power and high usability, a weak point of BPMN is the lack of formal se...
Selected Approaches for Testing Asset Pricing Models Using Polish Stock Market Data
The main objective of this paper was to discuss alternative methods for testing the Fama-French (FF) three-factor asset pricing model. The properties of the selected methods were compared in a simulation study. The main...
Advances in Cone-Based Preference Modeling for Decision Making with Multiple Criteria
Decision making with multiple criteria requires preferences elicited from the decision maker to determine a solution set. Models of preferences, that follow upon the concept of nondominated solutions introduced by Yu (19...
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...