A game theoretic approach to a problem in polymatroid maximization
From MaRDI portal
Publication:2098075
DOI10.1016/j.ejor.2022.06.018OpenAlexW3205067893MaRDI QIDQ2098075
Lisa Hellerstein, Thomas F. Lidbetter
Publication date: 17 November 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.10236
Cites Work
- Unnamed Item
- Unnamed Item
- Sequencing unreliable jobs on parallel machines
- A faster strongly polynomial time algorithm for submodular function minimization
- The theory of search games and rendezvous.
- The expanding search ratio of a graph
- Structure of a simple scheduling polyhedron
- Selecting jobs for scheduling on a machine subject to failure
- Weighted network search games with multiple hidden objects and multiple search teams
- Search and rescue in the face of uncertain threats
- SEARCH GAMES: LITERATURE AND SURVEY
- Search Games with Multiple Hidden Objects
- Decomposition Algorithm for the Single Machine Scheduling Polytope
- Characterization and Optimization of Achievable Performance in General Queueing Systems
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- A Characterization of Waiting Time Performance Realizable by Single-Server Queues
- Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
- A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
- Algorithms for distributional and adversarial pipelined filter ordering problems
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games
- Searching a Variable Speed Network
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
