«Operations Research Games»

Vito Fragnelli; Roberto Tadei

Bollettino dell'Unione Matematica Italiana (2005)

  • Volume: 8-A, Issue: 1, page 107-122
  • ISSN: 0392-4041

Abstract

top
In this paper we present a wide class of games, the so-called Operations Research Games, that are the natural extension of classical Operations Research problems when many decision-makers interact. We consider cooperative games with transferable utility. After recalling the main features of this class of games and of the most usual solution concepts, three examples of Operations Research Games-production games, spanning tree games and sequencing games- are presented.

How to cite

top

Fragnelli, Vito, and Tadei, Roberto. "«Operations Research Games»." Bollettino dell'Unione Matematica Italiana 8-A.1 (2005): 107-122. <http://eudml.org/doc/289474>.

@article{Fragnelli2005,
abstract = {In questo articolo viene presentata una vasta classe di giochi, gliOperations Research Games, che costituiscono la naturale estensione dei problemi classici della Ricerca Operativa al caso in cui sono presenti più decisori, che interagiscono fra di loro. Si tratta di giochi cooperativi a utilità trasferibile. Dopo aver richiamato le caratteristiche principali di tali giochi e dei concetti di soluzione più comuni, vengono presentati alcuni esempi di Operations Research Games, quali i giochi di produzione, i giochi di connessione ed i giochi di sequenziamento.},
author = {Fragnelli, Vito, Tadei, Roberto},
journal = {Bollettino dell'Unione Matematica Italiana},
language = {ita},
month = {4},
number = {1},
pages = {107-122},
publisher = {Unione Matematica Italiana},
title = {«Operations Research Games»},
url = {http://eudml.org/doc/289474},
volume = {8-A},
year = {2005},
}

TY - JOUR
AU - Fragnelli, Vito
AU - Tadei, Roberto
TI - «Operations Research Games»
JO - Bollettino dell'Unione Matematica Italiana
DA - 2005/4//
PB - Unione Matematica Italiana
VL - 8-A
IS - 1
SP - 107
EP - 122
AB - In questo articolo viene presentata una vasta classe di giochi, gliOperations Research Games, che costituiscono la naturale estensione dei problemi classici della Ricerca Operativa al caso in cui sono presenti più decisori, che interagiscono fra di loro. Si tratta di giochi cooperativi a utilità trasferibile. Dopo aver richiamato le caratteristiche principali di tali giochi e dei concetti di soluzione più comuni, vengono presentati alcuni esempi di Operations Research Games, quali i giochi di produzione, i giochi di connessione ed i giochi di sequenziamento.
LA - ita
UR - http://eudml.org/doc/289474
ER -

References

top
  1. AUMANN, R. J. - MASCHLER, M., The Bargaining Set for Cooperative Games, in Advances in Game Theory (Annals of Mathematics Studies, 52) ( Dresher M, Shapley LS, Tucker AW eds.), Princeton, Princeton University Press, 443-476 (1964). MR176842
  2. BANZHAF, J. F., Weighted Voting doesn’t Work: A Mathematical Analysis, Rutgers Law Review, 19 (1965), 317-343. 
  3. BIRD, C., On Cost Allocation for a Spanning Tree: A Game Theoretic Approach, Networks, 6 (1976), 335-350. Zbl0357.90083MR441390DOI10.1002/net.3230060404
  4. BJØRNDAL, E. - KOSTER, M. - TIJS, S., Weighted Allocation Rules for Standard Fixed Tree Games, CentER Discussion Paper 79, Tilburg University (1999). 
  5. BORM, P. - HAMERS, H. - HENDRICKX, R., Operations Research Games: A Survey, TOP, 9 (2001), 139-216. MR1878668DOI10.1007/BF02579075
  6. BRANZEI, R. - FERRARI, G. - FRAGNELLI, V. - TIJS, S., Two Approaches to the Problem of Sharing Delay Costs in Joint Projects, Annals of Operations Research, 109 (2002), 359-374. Zbl1005.91010MR1929740DOI10.1023/A:1016372707256
  7. CURIEL, I., Cooperative Game Theory and Applications, Kluwer Academic Publisher, Dordrecht, The Netherlands (1997). Zbl0948.91501MR1797365DOI10.1007/978-1-4757-4871-0
  8. CURIEL, I. - PEDERZOLI, G. - TIJS, S., Sequencing Games, European Journal of Operations Research, 7 (40) (1989), 344-351. MR1004986DOI10.1016/0377-2217(89)90427-X
  9. DAVIS, M. - MASCHLER, M., The Kernel of a Cooperative Game, Naval Research Logistics Quarterly, 12 (1965), 223-259. Zbl0204.20202MR207404DOI10.1002/nav.3800120303
  10. DEEGAN, J. - PACKEL, E. W., A New Index of Power for Simple n-Person Games, International Journal of Game Theory, 7 (1978), 113-123. Zbl0389.90093MR507589DOI10.1007/BF01753239
  11. DELPIANO, R., Tesi di laurea, Corso di Laurea in Matematica per le Scienze dell’Ingegneria, Politecnico di Torino (2003). 
  12. FRAGNELLI, V. - GARCIA-JURADO, I. - MENDEZ-NAYA, L., On Shortest Path Games, Mathematical Methods of Operations Research, 52 (2000), 139- 216. MR1797251DOI10.1007/s001860000061
  13. FRAGNELLI, V. - GARCIA-JURADO, I. - MENDEZ-NAYA, L., A Note on Bus Games, Economics Letters, 82 (2004), 99-106. Zbl1254.91288MR2028199DOI10.1016/j.econlet.2003.08.001
  14. GARIN, F., Tesi di laurea, Corso di Laurea in Matematica per le Scienze dell’Ingegneria, Politecnico di Torino (2002). 
  15. GILLIES, D. B., Some Theorems on n-person Games, PhD Thesis, Princeton University (1953). Zbl0050.14406MR2612094
  16. GRANOT, D. - HUBERMAN, G., Minimum Cost Spanning Tree Games, Mathematical Programming, 21 (1981), 1-18. Zbl0461.90099MR618611DOI10.1007/BF01584227
  17. HAMERS, H. - BORM, P. - VAN DE LEENSEL, R. - TIJS, S., Cost Allocation in the Chinese Postman Problem, European Journal of Operations Research, 118 (1999), 153-163. Zbl0945.90072
  18. KALAI, E. - ZEMEL, E., Totally Balanced Games and Games of Flow, Mathematics of Operations Research, 7 (1982), 476-478. Zbl0498.90030MR667936DOI10.1287/moor.7.3.476
  19. KRUSKAL, J. B., On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proceedings of the American Mathematical Society, 7 (1956), 48-50. Zbl0070.18404MR78686DOI10.2307/2033241
  20. KUIPERS, J., Minimum Cost Forest Games, International Journal of Game Theory, 26 (1997), 367-377. Zbl0880.90157MR1467837DOI10.1007/s001820050040
  21. LI CALZI, M., Un eponimo ricorrente: Nash e la teoria dei giochi, Bollettino UMI, sez. A, 6 (2003), 3-26. 
  22. LITTLECHILD, S. C. - OWEN, G., A Simple Expression for the Shapley Value in a Special Case, Management Science, 20 (1973), 370-372. Zbl0307.90095
  23. MECA, A. - TIMMER, J. - GARCA-JURADO, I. - BORM, P., Inventory Games, European Journal of Operational Research, 156 (2004), 127-139. MR2057454DOI10.1016/S0377-2217(02)00913-X
  24. O’NEILL, B., A Problem of Rights Arbitration from the Talmud, Mathematical Social Sciences, 2 (1984), 345-371. MR662176DOI10.1016/0165-4896(82)90029-4
  25. OWEN, G., On the Core of Linear Production Games, Mathematical Programming, 9 (1975), 358-370. Zbl0318.90060MR403700DOI10.1007/BF01681356
  26. OWEN, G., Values of Games with a Priori Unions, Lecture Notes in Economic and Mathematical Systems, 141 (1977), 76-88. Zbl0395.90095MR456544
  27. PEDERZOLI, G., Communication games, Control and Cybernetics, 20 (1991), 67-86. MR1136853
  28. POTTERS, J. A. M. - CURIEL, I. - TIJS, S., Traveling Salesman Games, Mathematical Programming, 53 (1992), 199-211. Zbl0749.90094MR1148013DOI10.1007/BF01585702
  29. PRIM, R. C., Shortest Connection Networks and Some Generalizations, Bell System Technical Journal, 36 (1957), 1389-1401. 
  30. SANCHEZ-SORIANO, J. - LOPEZ, M. A. - GARCIA-JURADO, I., On the Core of Transportation Games, Mathematical Social Sciences, 41 (2001), 215- 225. Zbl0973.91005MR1806686DOI10.1016/S0165-4896(00)00057-3
  31. SCHMEIDLER, D., The Nucleolus of a Characteristic Function Game, SIAM Journal of Applied Mathematics, 17 (1969), 1163-1170. Zbl0191.49502MR260432DOI10.1137/0117107
  32. SHAPLEY, L. S., A Value for n-Person Games, in Contributions to the Theory of Games, Vol II (Annals of Mathematics Studies28) ( Kuhn HW, Tucker AW eds.), Princeton University Press, Princeton, USA: 307-317 (1953). MR53477
  33. SHAPLEY, L. S. - SHUBIK, M., A Method for Evaluating The Distribution of Power in a Committee System, American Political Science Review, 48 (1954), 787-792. MR989821DOI10.1017/CBO9780511528446.004
  34. SHAPLEY, L. S. - SHUBIK, M., The Assignment Game I: The Core, International Journal of Game Theory, 7 (1) (1972), 111-130. Zbl0236.90078MR311290DOI10.1007/BF01753437
  35. SMITH, W., Various Optimizer for Single-Stage Production, Naval Research Logistics Quarterly, 3 (1956), 59-66. MR89109DOI10.1002/nav.3800030106
  36. SHUBIK, M., Strategy and Market Structure: Competition, Oligopoly, and the Theory of Games, Wiley, New York, USA (195). Zbl0095.14801MR118510
  37. STRAFFIN, P. D. - HEANEY, J. P., Game Theory and the Tennessee Valley Authority, Management Science, 32 (1986), 1015-1028. Zbl0452.90100
  38. TIJS, S. - MECA, A. - LOPEZ, M. A., Benefit Sharing in Holding Situations, di prossima pubblicazione su European Journal of Operational Research (2004). MR2101907DOI10.1016/j.ejor.2003.06.030
  39. TIJS, S. - PARTHASARATHY, T. - POTTERS, J. - PRASAD, R., Permutation Games: Another Class of Totally Balanced Games, OR Spektrum, 6 (1984), 119-123. Zbl0537.90101
  40. VARIO, I., Tesi di laurea, Corso di Laurea in Matematica per le Scienze dell’Ingegneria, Politecnico di Torino. 
  41. VON NEUMANN, J. - MORGENSTERN, O., Theory of Games and Economic Behavior (2nd ed. 1947, 3rd ed. 1953), Princeton University Press, Princeton, USA (1944). Zbl0063.05930MR21298

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.