Nonadditive Shortest Paths: Subproblems in Multi-Agent Competitive Network Models

Steven A. Gabriel () and David Bernstein ()
Additional contact information
Steven A. Gabriel: The George Washington University and ICF Consulting
David Bernstein: James Madison University

Computational and Mathematical Organization Theory, 2000, vol. 6, issue 1, No 3, 29-45

Abstract: Abstract A variety of different multi-agent (competitive) network models have been described in the literature. Computational techniques for solving such models often involve the iterative solution of “shortest” path subproblems. Unfortunately, the most theoretically interesting models involve nonlinear cost or utility functions and they give rise to nonadditive “shortest” path subproblems. This paper both describes some basic existence and uniqueness results for these subproblems and develops a heuristic for solving them.

Keywords: shortest paths; network optimization; network equilibrium; competitive network models (search for similar items in EconPapers)
Date: 2000
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009621108971 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:comaot:v:6:y:2000:i:1:d:10.1023_a:1009621108971

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10588

DOI: 10.1023/A:1009621108971

Access Statistics for this article

Computational and Mathematical Organization Theory is currently edited by Terrill Frantz and Kathleen Carley

More articles in Computational and Mathematical Organization Theory from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().