Name
Abstract | ||
|---|---|---|
<P>We consider the problem of determining rates for a situation in which services are purchased in bulk but have to be paid for by a large number of small users. The desired rates must be \"fair\" and they must cover all costs. The problem is formulated as a non-atomic game and solved by using the value of the game. In addition to the general problem, we present a detailed actual case, together with computational methods and results.</P> |
Year | DOI | Venue |
|---|---|---|
1978 | 10.1287/opre.26.6.956 | Operations Research |
Keywords | Field | DocType |
scheduling,game theory,industrial engineering,technical report,operations research,mathematical programming | Mathematical optimization,Scheduling (computing),Computer science,Algorithmic game theory,Game theory,Operations management,Technical report | Journal |
Volume | Issue | ISSN |
26 | 6 | 0030-364X |
Citations | PageRank | References |
29 | 12.27 | 1 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| L. J. Billera | 1 | 134 | 49.51 |
| D. C. Heath | 2 | 67 | 27.11 |
| J. Raanan | 3 | 38 | 14.91 |