Skip to main content
Top

2017 | OriginalPaper | Chapter

A Game Theoretic Approach to an Emergency Units Location Problem

Authors : Vito Fragnelli, Stefano Gagliardo, Fabio Gastaldi

Published in: Spatial Interaction Models

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this paper we consider the problem of locating emergency units in a given area, defining a suitable class of TU-games. The Shapley value results to be a very good solution for this class of games. A simple formula for computing the Shapley value is derived. A real-world example and some comments conclude.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Footnotes
1
 By aggregated demand we mean the sum of the demands coming from all the zones covered by a location.
 
2
 The algorithm ran on a Desktop PC with an Intel Core i5-2400 Processor, 3.10 GHz, with 8 GB RAM.
 
3
The travelling time have been obtained thanks to the information provided by the 118 of Milan on the real average travelling time of an ambulance from each of the possible locations to each of the municipalities in the area; the time threshold of 18 min is determined by the 20 min allowed to reach the location of an event, minus the 2 min spent (on average) to answer the call.
 
4
We omitted the candidate locations which an ambulance is never assigned to: Bellinzago, Bollate, Cassano, Ceriano, Cislago, Cuggiono, Inzago, Lainate, Novate, Pozzuolo, Solaro, Uboldo.
 
Literature
1.
go back to reference Ball, M.O., Lin, F.L.: A reliability model applied to emergency service vehicle location. Oper. Res. 41 (1), 18–36 (1993)CrossRefMATH Ball, M.O., Lin, F.L.: A reliability model applied to emergency service vehicle location. Oper. Res. 41 (1), 18–36 (1993)CrossRefMATH
2.
go back to reference Banzhaf, J.: Weighted voting doesn’t work: a mathematical analysis. Rutgers Law Rev. 10, 317–343 (1965) Banzhaf, J.: Weighted voting doesn’t work: a mathematical analysis. Rutgers Law Rev. 10, 317–343 (1965)
3.
go back to reference Branas, C.C., MacKenzie, E.J., ReVelle, C.S.: A trauma resource allocation model for ambulances and hospitals. Health Serv. Res. 35, 489–507 (2000) Branas, C.C., MacKenzie, E.J., ReVelle, C.S.: A trauma resource allocation model for ambulances and hospitals. Health Serv. Res. 35, 489–507 (2000)
5.
go back to reference Church, R.L., ReVelle, C.S.: The maximal covering location problem. Pap. Reg. Sci. Assoc. 32, 101–118 (1974)CrossRef Church, R.L., ReVelle, C.S.: The maximal covering location problem. Pap. Reg. Sci. Assoc. 32, 101–118 (1974)CrossRef
6.
7.
go back to reference Daskin, M.S.: A maximum expected covering location model: formulation, properties and heuristic solution. Transp. Sci. 17 (1), 48–70 (1983)CrossRef Daskin, M.S.: A maximum expected covering location model: formulation, properties and heuristic solution. Transp. Sci. 17 (1), 48–70 (1983)CrossRef
8.
go back to reference Derekenaris, G., Garofalakis, J., Makris, C., Prentzas, J., Sioutas, S., Tsakalidis, A.: Integrating GIS, GPS and GSM technologies for the effective management of ambulances. Comput. Environ. Urban Syst. 25, 267–278 (2001) Derekenaris, G., Garofalakis, J., Makris, C., Prentzas, J., Sioutas, S., Tsakalidis, A.: Integrating GIS, GPS and GSM technologies for the effective management of ambulances. Comput. Environ. Urban Syst. 25, 267–278 (2001)
9.
go back to reference Drezner, Z.: Facility Location: A Survey of Applications and Methods. Springer, Berlin (1995)CrossRef Drezner, Z.: Facility Location: A Survey of Applications and Methods. Springer, Berlin (1995)CrossRef
10.
go back to reference Drezner, Z., Hamacher, H.W.: Facility Location: Application and Theory. Springer, Berlin (2001)MATH Drezner, Z., Hamacher, H.W.: Facility Location: Application and Theory. Springer, Berlin (2001)MATH
11.
go back to reference Farahani, R.Z., SteadieSeifi, M., Asgari, N.: Multiple criteria facility location problems: a survey. Appl. Math. Model. 34, 1689–1709 (2010)MathSciNetCrossRefMATH Farahani, R.Z., SteadieSeifi, M., Asgari, N.: Multiple criteria facility location problems: a survey. Appl. Math. Model. 34, 1689–1709 (2010)MathSciNetCrossRefMATH
12.
13.
go back to reference Fujiwara, O., Makjamroen, T., Gupta, K.K.: Ambulance deployment analysis: a case study of Bangkok. Eur. J. Oper. Res. 31 (1), 9–18 (1987)CrossRef Fujiwara, O., Makjamroen, T., Gupta, K.K.: Ambulance deployment analysis: a case study of Bangkok. Eur. J. Oper. Res. 31 (1), 9–18 (1987)CrossRef
15.
go back to reference Goldberg, J., Dietrich, R., Chen, J.M., Mitwasi, M.G.: A simulation model for evaluating a set of emergency vehicle base locations: development, validation and usage. Socio Econ. Plan. Sci. 24, 124–141 (1990)CrossRef Goldberg, J., Dietrich, R., Chen, J.M., Mitwasi, M.G.: A simulation model for evaluating a set of emergency vehicle base locations: development, validation and usage. Socio Econ. Plan. Sci. 24, 124–141 (1990)CrossRef
16.
go back to reference Grabisch, M., Roubens, M.: An axiomatic approach to the concept of interaction among players in cooperative games. Int. J. Game Theory 28 (4), 547–565 (1999)MathSciNetCrossRefMATH Grabisch, M., Roubens, M.: An axiomatic approach to the concept of interaction among players in cooperative games. Int. J. Game Theory 28 (4), 547–565 (1999)MathSciNetCrossRefMATH
19.
go back to reference Hotelling, H.: Stability in competition. Econ. J. 39, 41–57 (1929) Hotelling, H.: Stability in competition. Econ. J. 39, 41–57 (1929)
20.
go back to reference Huck, S., Knoblauch, V., Müller, W.: On the profitability of collusion in location games. J. Urban Econ. 54, 499–510 (2003)CrossRef Huck, S., Knoblauch, V., Müller, W.: On the profitability of collusion in location games. J. Urban Econ. 54, 499–510 (2003)CrossRef
21.
go back to reference Immorlica, N., Mahdian, M., Vahab, S.M.: Limitations of cross-monotonic cost-sharing schemes. ACM Trans. Algorithms 4 (2), Article 24 (2008) Immorlica, N., Mahdian, M., Vahab, S.M.: Limitations of cross-monotonic cost-sharing schemes. ACM Trans. Algorithms 4 (2), Article 24 (2008)
22.
go back to reference Knoblauch, V.: Generalizing location games to a graph. J. Ind. Econ. 39, 683–688 (1991)CrossRef Knoblauch, V.: Generalizing location games to a graph. J. Ind. Econ. 39, 683–688 (1991)CrossRef
23.
go back to reference Knoblauch, V.: A pure strategy Nash equilibrium for a three-firm location game on a two dimensional set. Locat. Sci. 4, 247–250 (1997)CrossRefMATH Knoblauch, V.: A pure strategy Nash equilibrium for a three-firm location game on a two dimensional set. Locat. Sci. 4, 247–250 (1997)CrossRefMATH
24.
go back to reference Leonardi, S., Shäfer, G.: Cross-monotonic cost sharing methods for connected facilities location games. Theor. Comput. Sci. 326, 431–442 (2004)CrossRefMATH Leonardi, S., Shäfer, G.: Cross-monotonic cost sharing methods for connected facilities location games. Theor. Comput. Sci. 326, 431–442 (2004)CrossRefMATH
26.
28.
go back to reference McLafferty, S.L.: GIS and health care. Annu. Rev. Public Health 24, 25–42 (2003)CrossRef McLafferty, S.L.: GIS and health care. Annu. Rev. Public Health 24, 25–42 (2003)CrossRef
29.
go back to reference Nickel, S., Puerto, J.: Location Theory: A Unified Approach. Springer, Berlin (2005)MATH Nickel, S., Puerto, J.: Location Theory: A Unified Approach. Springer, Berlin (2005)MATH
30.
go back to reference Pal, M., Tardos, E.: Group strategyproof mechanisms via primal-dual algorithms. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 584–593 (2003) Pal, M., Tardos, E.: Group strategyproof mechanisms via primal-dual algorithms. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 584–593 (2003)
31.
go back to reference Plastria, F.: Static competitive facility location: an overview of optimisation approaches. Eur. J. Oper. Res. 129, 461–470 (2001)MathSciNetCrossRefMATH Plastria, F.: Static competitive facility location: an overview of optimisation approaches. Eur. J. Oper. Res. 129, 461–470 (2001)MathSciNetCrossRefMATH
32.
go back to reference Puerto, J., Garcia-Jurado, I., Fernandez, F.R.: On the core of a class of location games. Math. Methods Oper. Res. 54, 373–385 (2001)MathSciNetCrossRefMATH Puerto, J., Garcia-Jurado, I., Fernandez, F.R.: On the core of a class of location games. Math. Methods Oper. Res. 54, 373–385 (2001)MathSciNetCrossRefMATH
33.
go back to reference Puerto, J., Tamir, A., Perea, F.: A cooperative location game based on the 1-center location problem. Eur. J. Oper. Res. 214, 317–330 (2011)MathSciNetCrossRefMATH Puerto, J., Tamir, A., Perea, F.: A cooperative location game based on the 1-center location problem. Eur. J. Oper. Res. 214, 317–330 (2011)MathSciNetCrossRefMATH
34.
go back to reference Puerto, J., Tamir, A., Perea, F.: Cooperative location games based on the minimum spanning Steiner subgraph problem. Discrete Appl. Math. 160, 970–979 (2012)MathSciNetCrossRefMATH Puerto, J., Tamir, A., Perea, F.: Cooperative location games based on the minimum spanning Steiner subgraph problem. Discrete Appl. Math. 160, 970–979 (2012)MathSciNetCrossRefMATH
35.
go back to reference Repede, J.F., Bernardo, J.J.: Developing and validating a decision support system for locating emergency medical vehicles in Louisville, Kentucky. Eur. J. Oper. Res. 75, 567–581 (1994)CrossRef Repede, J.F., Bernardo, J.J.: Developing and validating a decision support system for locating emergency medical vehicles in Louisville, Kentucky. Eur. J. Oper. Res. 75, 567–581 (1994)CrossRef
36.
go back to reference ReVelle, C.S., Hogan, K.: The maximum reliability location problem and α-reliable p-center problem: derivatives of the probabilistic location set covering problem. Ann. Oper. Res. 18 (1), 155–173 (1989)MathSciNetCrossRefMATH ReVelle, C.S., Hogan, K.: The maximum reliability location problem and α-reliable p-center problem: derivatives of the probabilistic location set covering problem. Ann. Oper. Res. 18 (1), 155–173 (1989)MathSciNetCrossRefMATH
37.
go back to reference Schilling, D.A., Elzinga, D.J., Cohon, J.L., Church, R.L., ReVelle, C.S.: The TEAM-FLEET models for simultaneous facility and equipment sitting. Transp. Sci. 13, 163–175 (1979)CrossRef Schilling, D.A., Elzinga, D.J., Cohon, J.L., Church, R.L., ReVelle, C.S.: The TEAM-FLEET models for simultaneous facility and equipment sitting. Transp. Sci. 13, 163–175 (1979)CrossRef
39.
go back to reference Shapley, L.S.: A value for n-person games. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games, vol. 2, pp. 307–317. Princeton University Press, Princeton (1953) Shapley, L.S.: A value for n-person games. In: Kuhn, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games, vol. 2, pp. 307–317. Princeton University Press, Princeton (1953)
40.
go back to reference Taillard, E.D., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170–186 (1997)CrossRefMATH Taillard, E.D., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170–186 (1997)CrossRefMATH
41.
go back to reference Tamir, A.: On the core of cost allocation games defined on locational problems. Transp. Sci. 27, 81–86 (1992)CrossRefMATH Tamir, A.: On the core of cost allocation games defined on locational problems. Transp. Sci. 27, 81–86 (1992)CrossRefMATH
42.
go back to reference Topkis, D.: Supermodularity and Complementarity. Princeton University Press, Princeton (1998) Topkis, D.: Supermodularity and Complementarity. Princeton University Press, Princeton (1998)
43.
go back to reference Toregas, C., Swain, R., ReVelle, C., Bergman, L.: The location of emergency service facilities. Oper. Res. 19 (6), 1363–1373 (1971)CrossRefMATH Toregas, C., Swain, R., ReVelle, C., Bergman, L.: The location of emergency service facilities. Oper. Res. 19 (6), 1363–1373 (1971)CrossRefMATH
Metadata
Title
A Game Theoretic Approach to an Emergency Units Location Problem
Authors
Vito Fragnelli
Stefano Gagliardo
Fabio Gastaldi
Copyright Year
2017
DOI
https://doi.org/10.1007/978-3-319-52654-6_8

Premium Partner