Access

You are not currently logged in.

Access JSTOR through your library or other institution:

login

Log in through your institution.

Journal Article

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

You can always find the topics here!

Topics: Games, Economic theory, Mathematical problems, Mathematical theorems, Real numbers
Were these topics helpful?
See somethings inaccurate? Let us know!

Select the topics that are inaccurate.

Cancel
  • Download ($30.00)
  • Add to My Lists
  • Cite this Item
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