Network Interdiction

Alan Washburn
Additional contact information
Alan Washburn: Naval Postgraduate School

Chapter Chapter 7 in Two-Person Zero-Sum Games, 2014, pp 123-141 from Springer

Abstract: Abstract This chapter deals with a variety of competitive problems that occur on networks. Such problems deserve their own chapter because networks are becoming increasingly important in modern life. The Internet is a network, transportation systems are networks, power distribution systems are networks, communication systems are networks, social systems can be thought of as networks, and all of these are subject to competition between the intended users of the network and another player who wishes to interfere with that usage. In this chapter we will consistently refer to the two competing players as User and Breaker, rather than player 1 and player 2. Depending on the model, either player may be the maximizer. The models in Sect. 7.1 are maxmin formulations where Breaker’s actions are known to User. In Sect. 7.2 we consider games where Breaker can keep his actions secret.

Keywords: Survival Probability; Dual Variable; Maxmin Problem; Network Optimization Problem; Network Interdiction (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

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:isochp:978-1-4614-9050-0_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461490500

DOI: 10.1007/978-1-4614-9050-0_7

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().