GENERALIZED NETWORK PROBLEMS YIELDING TOTALLY BALANCED GAMES.

EHUD KALAI*, EITAN ZEMEL

*Corresponding author for this work

Research output: Contribution to journalArticle

112 Scopus citations

Abstract

A CLASS OF MULTIPERSON MATHEMATICAL OPTIMIZATION PROBLEMS IS CONSIDERED AND IS SHOWN TO GENERATE COOPERATIVE GAMES WITHNONEMPTY CORES. THE CLASS INCLUDES, BUT IS NOT RESTRICTED TO, NUMEROUS VERSIONS OF NETWORK FLOW PROBLEMS. IT WAS SHOWN BY G. OWEN THAT FOR GAMES GENERATED BY LINEAR PROGRAMMING OPTIMIZATION PROBLEMS, OPTIMAL DUAL SOLUTIONS CORRESPOND TO POINTS IN THE CORE. THE AUTHORS IDENTIFY A SPECIAL CLASS OF NETWORK FLOW PROBLEMS FOR WHICH THE CONVERSE IS TRUE, I. E. , EVERY POINT IN THE CORE CORRESPONDS TO AN OPTIMAL DUAL SOLUTION. THIS WORK IS PERTINENT TO TRANSPORTATION AND INTEGRATEDPRODUCTION.

Original languageEnglish (US)
Pages (from-to)998-1008
Number of pages11
JournalOPER RES
VolumeV 30
Issue numberN 5
DOIs
StatePublished - 1982

ASJC Scopus subject areas

  • Computer Science Applications
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'GENERALIZED NETWORK PROBLEMS YIELDING TOTALLY BALANCED GAMES.'. Together they form a unique fingerprint.

  • Cite this