Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
481847 | European Journal of Operational Research | 2010 | 5 Pages |
Abstract
We consider the problem of scheduling activities of a project by a firm that competes with another firm that has to perform the same project. The profit that a firm gets from each activity depends on whether the firm finishes the activity before or after its competitor. It is required to find a Nash equilibrium solution or show that no such solutions exist. We present a structural characterization of Nash equilibrium solutions, and a low order polynomial algorithm for the problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Igor Averbakh,