Inspection games with local and global allocation bounds
From MaRDI portal
Publication:3120592
DOI10.1002/nav.21524zbMath1407.91073OpenAlexW1984195735MaRDI QIDQ3120592
Uriel G. Rothblum, Boaz Golany, Yael Deutsch, Noam Goldberg
Publication date: 5 March 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21524
Noncooperative games (91A10) 2-person games (91A05) Applications of game theory (91A80) Reliability, availability, maintenance, inspection in operations research (90B25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (5)
Multiple agents finitely repeated inspection game with dismissals ⋮ Incorporating monitoring technology and on-site inspections into an \(n\)-person inspection game ⋮ A two‐stage network interdiction‐monitoring game ⋮ A polynomial-time method to compute all Nash equilibria solutions of a general two-person inspection game ⋮ Evolutionary inspection and corruption games
This page was built for publication: Inspection games with local and global allocation bounds
