Two-person games for stochastic network interdiction: Models, methods, and complexities
We describe a stochastic network interdiction problem in which an interdictor, subject to limited resources, installs radiation detectors at border checkpoints in a transportation network in order to minimize the probability that a smuggler of nuclear material can traverse the residual network undet...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertation |
| Language: | English |
| Published: |
ProQuest Dissertations & Theses
01.01.2009
|
| Subjects: | |
| ISBN: | 9781109571813, 110957181X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We describe a stochastic network interdiction problem in which an interdictor, subject to limited resources, installs radiation detectors at border checkpoints in a transportation network in order to minimize the probability that a smuggler of nuclear material can traverse the residual network undetected. The problems are stochastic because the smuggler's origin-destination pair, the mass and type of material being smuggled, and the level of shielding are known only through a probability distribution when the detectors are installed. We consider three variants of the problem. The first is a Stackelberg game which assumes that the smuggler chooses a maximum-reliability path through the network with full knowledge of detector locations. The second is a Cournot game in which the interdictor and the smuggler act simultaneously. The third is a "hybrid" game in which only a subset of detector locations is revealed to the smuggler. In the Stackelberg setting, the problem is NP-complete even if the interdictor can only install detectors at border checkpoints of a single country. However, we can compute wait-and-see bounds in polynomial time if the interdictor can only install detectors at border checkpoints of the origin and destination countries. We describe mixed-integer programming formulations and customized branch-and-bound algorithms which exploit this fact, and provide computational results which show that these specialized approaches are substantially faster than more straightforward integer-programming implementations. We also present some special properties of the single-country case and a complexity landscape for this family of problems. The Cournot variant of the problem is potentially challenging as the interdictor must place a probability distribution over an exponentially-sized set of feasible detector deployments. We use the equivalence of optimization and separation to show that the problem is polynomially solvable in the single-country case if the detectors have unit installation costs. We present a row-generation algorithm and a version of the weighted majority algorithm to solve such instances. We use an exact-penalty result to formulate a model in which some detectors are visible to the smuggler and others are not. This may be appropriate to model "decoy" detectors and detector upgrades. |
|---|---|
| AbstractList | We describe a stochastic network interdiction problem in which an interdictor, subject to limited resources, installs radiation detectors at border checkpoints in a transportation network in order to minimize the probability that a smuggler of nuclear material can traverse the residual network undetected. The problems are stochastic because the smuggler's origin-destination pair, the mass and type of material being smuggled, and the level of shielding are known only through a probability distribution when the detectors are installed. We consider three variants of the problem. The first is a Stackelberg game which assumes that the smuggler chooses a maximum-reliability path through the network with full knowledge of detector locations. The second is a Cournot game in which the interdictor and the smuggler act simultaneously. The third is a "hybrid" game in which only a subset of detector locations is revealed to the smuggler. In the Stackelberg setting, the problem is NP-complete even if the interdictor can only install detectors at border checkpoints of a single country. However, we can compute wait-and-see bounds in polynomial time if the interdictor can only install detectors at border checkpoints of the origin and destination countries. We describe mixed-integer programming formulations and customized branch-and-bound algorithms which exploit this fact, and provide computational results which show that these specialized approaches are substantially faster than more straightforward integer-programming implementations. We also present some special properties of the single-country case and a complexity landscape for this family of problems. The Cournot variant of the problem is potentially challenging as the interdictor must place a probability distribution over an exponentially-sized set of feasible detector deployments. We use the equivalence of optimization and separation to show that the problem is polynomially solvable in the single-country case if the detectors have unit installation costs. We present a row-generation algorithm and a version of the weighted majority algorithm to solve such instances. We use an exact-penalty result to formulate a model in which some detectors are visible to the smuggler and others are not. This may be appropriate to model "decoy" detectors and detector upgrades. |
| Author | Nehme, Michael Victor |
| Author_xml | – sequence: 1 givenname: Michael surname: Nehme middlename: Victor fullname: Nehme, Michael Victor |
| BookMark | eNotjUtLxDAYAAMqqGv_Q_BsIWnSPLzJ4gtWvBQ8Lk3y1UbbpCZZ1p9vwT3NnGau0XmIAc5QpaWilOhWUkXZJapy9obQRrZKCHGFPrpjrBdIOQb82c-Q8RATziXasc_FWxygHGP6xj4USM7b4mO4x2_RwZTv8AxljG6VPjhs47xM8OuLh3yDLoZ-ylCduEHd02O3fal378-v24ddPQpF6kGohlHDnDZM9tRxwjkdWiIdgDbWcqecZcZRo1fXUlvJG8HZIAgHJRq2Qbf_2SXFnwPksv-KhxTW456RllDCGGF_JoxQGg |
| ContentType | Dissertation |
| Copyright | Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| Copyright_xml | – notice: Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works. |
| DBID | 053 0BH 0PG CBPLH EU9 G20 M8- PHGZT PKEHL PQEST PQQKQ PQUKI |
| DatabaseName | Dissertations & Theses Europe Full Text: Science & Technology ProQuest Dissertations and Theses Professional Dissertations & Theses @ University of Texas - Austin ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations & Theses A&I ProQuest Dissertations & Theses Global ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition |
| DatabaseTitle | Dissertations & Theses Europe Full Text: Science & Technology ProQuest One Academic Middle East (New) ProQuest One Academic UKI Edition ProQuest One Academic Eastern Edition Dissertations & Theses @ University of Texas - Austin ProQuest Dissertations & Theses Global: The Sciences and Engineering Collection ProQuest Dissertations and Theses Professional ProQuest One Academic ProQuest Dissertations & Theses A&I ProQuest One Academic (New) ProQuest Dissertations and Theses A&I: The Sciences and Engineering Collection ProQuest Dissertations & Theses Global |
| DatabaseTitleList | Dissertations & Theses Europe Full Text: Science & Technology |
| Database_xml | – sequence: 1 dbid: G20 name: ProQuest Dissertations & Theses Global url: https://www.proquest.com/pqdtglobal1 sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| ExternalDocumentID | 1958579281 |
| Genre | Dissertation/Thesis |
| GroupedDBID | 053 0BD 0BH 0PG ALMA_UNASSIGNED_HOLDINGS CBPLH EU9 G20 M8- PHGZT PKEHL PQEST PQQKQ PQUKI |
| ID | FETCH-LOGICAL-h680-f68231b3d9b37a1d40441f507dee9bcc4d8dc3bd1b9c4d979c742643f604e8623 |
| IEDL.DBID | G20 |
| ISBN | 9781109571813 110957181X |
| IngestDate | Mon Jun 30 06:16:21 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-h680-f68231b3d9b37a1d40441f507dee9bcc4d8dc3bd1b9c4d979c742643f604e8623 |
| Notes | SourceType-Dissertations & Theses-1 ObjectType-Dissertation/Thesis-1 content type line 12 |
| PQID | 305010330 |
| PQPubID | 18750 |
| ParticipantIDs | proquest_journals_305010330 |
| PublicationCentury | 2000 |
| PublicationDate | 20090101 |
| PublicationDateYYYYMMDD | 2009-01-01 |
| PublicationDate_xml | – month: 01 year: 2009 text: 20090101 day: 01 |
| PublicationDecade | 2000 |
| PublicationYear | 2009 |
| Publisher | ProQuest Dissertations & Theses |
| Publisher_xml | – name: ProQuest Dissertations & Theses |
| SSID | ssib012758666 ssib000933042 |
| Score | 1.5014819 |
| Snippet | We describe a stochastic network interdiction problem in which an interdictor, subject to limited resources, installs radiation detectors at border checkpoints... |
| SourceID | proquest |
| SourceType | Aggregation Database |
| SubjectTerms | Operations research |
| Title | Two-person games for stochastic network interdiction: Models, methods, and complexities |
| URI | https://www.proquest.com/docview/305010330 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV07T8MwED5BYUAMgAABBeSBEYsY52GzMAAVU8VQiW5V_KJIKC1Nefx87py0qoTEwmbLS2Q7d9_57r4P4KK0TtpIOSusxwDFpxydsOaZDJkRPgjlkig2UfT7ajjUT21tTt2WVS5sYjTUbmLpjfwK7yVJEsjkdvrOSTSKkqutgsY6bFBzbez1XUU_TbC-mBOVuUK0HvWCEFmgVRYtB89yLn-Z5Ohnejv__MJd2L5fya_vwZqv9uF58DXh04is2QsVxTIEqgxBnx2XxNLMqqYUnBF1BN6X2Olww0gl7a2-ZI3GNA7KyrFYge6_Iw3rAQx6D4O7R97qKfBxrhIeckr5Gem0kUUpXJogFAqIB5332libOuWsNE4YjWNdaFsQXJIhT1KPgY88hE41qfwRsLRw8toFUfgUvZvMTVBeZSUR2RgTrD2G7mKLRu0_UY-W-3Py52oXtpqMDT1znEJnPvvwZ7BpP-ev9ew8nvAPRxGvZA |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LS8NAEB5qFRQPKipqfexBbwaTbpqHIB6spaW1eAjYW8g-YgVJa1ut_id_pDObphQEbz142yUQSGZ355vHfh_AeSIVl4Zy1pEaAxTtWuiEQ6vG05pwdOoEyjZiE363G_R64WMJvou7MNRWWZyJ5qBWA0k58itclyRJwO3b4ZtFolFUXC0UNPJV0dZfU4zYxjetOpr3olpt3Ed3TWsmKmD1vcC2Uo_qXoKrUHA_cZRrIx5IERQprUMhpasCJblQjghxHPqh9Akz8NSzXY3on-NrV2DVJaI7ulq8CLby3EAxJ-b0AIMDI0-EQAadgDOj_JnP-S8PYNxaY-t__ZBt2KwvdA_sQElnu_AUTQfW0MQN7JlafhnCcIaQVvYT4qBmWd7ozogYA3eDucdxzUgD7nV8yXIFbRwkmWKmv15_GpLZPYiW8R37UM4GmT4A5vqKV1Xq-NpF3809kQY6qCVE0yNEKuUhVAqLxLMdP47n5jj68-kZrDejh07caXXbFdjIa1OU0DmG8mT0rk9gTX5MXsajU7O4GMRLtt0PaHMK4Q |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adissertation&rft.genre=dissertation&rft.title=Two-person+games+for+stochastic+network+interdiction%3A+Models%2C+methods%2C+and+complexities&rft.DBID=053%3B0BH%3B0PG%3BCBPLH%3BEU9%3BG20%3BM8-%3BPHGZT%3BPKEHL%3BPQEST%3BPQQKQ%3BPQUKI&rft.PQPubID=18750&rft.au=Nehme%2C+Michael+Victor&rft.date=2009-01-01&rft.pub=ProQuest+Dissertations+%26+Theses&rft.isbn=9781109571813&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=1958579281 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781109571813/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781109571813/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781109571813/sc.gif&client=summon&freeimage=true |