Skip to main content
SpringerLink
Log in

Semi-Infinite Assignment and Transportation Games

  • Chapter
Semi-Infinite Programming

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 57))

Abstract

Games corresponding to semi-infinite transportation and related assignment situations are studied. In a semi-infinite transportation situation, one aims at maximizing the profit from the transportation of a certain good from a finite number of suppliers to an infinite number of demanders. An assignment situation is a special kind of transportation situation where the supplies and demands for the good all equal one unit. It is shown that the special structure of these situations implies that the underlying infinite programs have no duality gap and that the core of the corresponding game is nonempty.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 189.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 249.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. I. Curiel, Cooperative Game Theory and Applications, Kluwer, 1997.

    Book  Google Scholar 

  2. F.Y. Edgeworth, Mathematical Psychics, Kegan, London, 1981.

    Google Scholar 

  3. V. Fragnelli, F. Patrone, E. Sideri, and S. Tijs. Balanced games arising from infinite linear models, Mathematical Methods of Operations Research, 50:385–397, 1999.

    Article  MathSciNet  MATH  Google Scholar 

  4. J.R.G. van Gellekom, J.A.M. Potters, J.H. Reijnierse, S.H. Tijs, and M.C. Engel. Characterization of the Owen set of linear production processes, games and economic behavior, 32:139–156, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  5. D.B. Gillies. Some theorems on N-person games. Dissertation, Princenton University, 1953.

    Google Scholar 

  6. K. Glashoff, and S-A. Gustafson. Linear Optimization andApproximation, Springer-Verlag, 1983.

    Book  Google Scholar 

  7. M. A. Goberna and M.A. López. LinearSemi-Infintite Optimization, Wiley, 1998.

    Google Scholar 

  8. N. Llorca, S. Tijs, and J. Timmer. Semi-infinite assignment problems and related games, International Garne Theory Review, 2:97–106, 2000.

    MathSciNet  MATH  Google Scholar 

  9. K.G. Murty. Linear Programming, Wiley, 1983.

    MATH  Google Scholar 

  10. G. Owen. On the Core of Linear Production Games, Mathematical Programming, 9:358–370, 1975.

    Article  MathSciNet  MATH  Google Scholar 

  11. G. Owen. Garme Theory, Academic Press, 1995.

    Google Scholar 

  12. J. Sánchez-Soriano, M.A. López, and I. García-Jurado. On the Core of Transportation Games, Mathematical Social Sciences, 2000.

    Google Scholar 

  13. A. Schrijver. Theory of Linear and Integer Prograrmrming, Wiley, 1986.

    Google Scholar 

  14. L.S. Shapley and S. Shubik. The Assignment Game I: The Core, International Journal of Garme Theory, 1:111–130, 1972.

    Article  MathSciNet  Google Scholar 

  15. J. Timmer, N. Llorca and S. Tijs. Games Arasing from Infinite Production Situations, International Gamne Theory Review, 2:97–106, 2000.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Statistics and Applied Mathematics, Miguel Hernández University, Elche Campus, La Galia Building, Avda. del Ferrocarril, s/n, 03202, Elche, Spain

    Joaquín Sánchez-Soriano & Natividad Llorca

  2. CentER and Department of Econometrics and Operations Research, Tilburg University, P.O. Box 90153, 5000, LE Tilburg, The Netherlands

    Stef Tijs & Judith Timmer

Authors
  1. Joaquín Sánchez-Soriano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Natividad Llorca
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stef Tijs
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Judith Timmer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universidad de Alicante, Spain

    Miguel Á. Goberna  & Marco A. López  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Sánchez-Soriano, J., Llorca, N., Tijs, S., Timmer, J. (2001). Semi-Infinite Assignment and Transportation Games. In: Goberna, M.Á., López, M.A. (eds) Semi-Infinite Programming. Nonconvex Optimization and Its Applications, vol 57. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3403-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3403-4_16

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-5204-2

  • Online ISBN: 978-1-4757-3403-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation