Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

If you need an accessible version of this item please contact JSTOR User Support

Totally Balanced Games and Games of Flow

Ehud Kalai and Eitan Zemel
Mathematics of Operations Research
Vol. 7, No. 3 (Aug., 1982), pp. 476-478
Published by: INFORMS
Stable URL: http://www.jstor.org/stable/3689611
Page Count: 3
  • Download ($30.00)
  • Cite this Item
If you need an accessible version of this item please contact JSTOR User Support
Totally Balanced Games and Games of Flow
Preview not available

Abstract

A class of characteristic function games arising from maximum flow problems is introduced and is shown to coincide with the class of totally balanced games. The proof relies on the max flow-min cut theorem of Ford and Fulkerson and on the observation that the class of totally balanced games is the span of the additive games with the minimum operation.

Page Thumbnails

  • Thumbnail: Page 
476
    476
  • Thumbnail: Page 
477
    477
  • Thumbnail: Page 
478
    478