A game theoretic approach to a problem in polymatroid maximization

DOI10.1016/J.EJOR.2022.06.018MaRDI QIDQ2098075zbMATH OpenOpenAlexFDO

Authors Lisa Hellerstein, Thomas 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

zbMATH Keywords

game theoryqueuingsearch gamessequential testing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• A polymatroid associated with convex games
• scientific article; zbMATH DE number 3062460
• A logarithmic approximation for polymatroid congestion games
• The Partial Order of a Polymatroid Extreme Point
• Sensitivity analysis for convex separable optimization over integral polymatroids

Cites work

• A Characterization of Waiting Time Performance Realizable by Single-Server Queues
• A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
• A faster strongly polynomial time algorithm for submodular function minimization
• Algorithms for distributional and adversarial pipelined filter ordering problems
• Characterization and Optimization of Achievable Performance in General Queueing Systems
• Decomposition algorithm for the single machine scheduling polytope
• scientific article; zbMATH DE number 1762087 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
• Mining coal or finding terrorists: the expanding search paradigm
• Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
• Search and rescue in the face of uncertain threats
• Search games with multiple hidden objects
• Search games: literature and survey
• Searching a variable speed network
• Selecting jobs for scheduling on a machine subject to failure
• Sequencing unreliable jobs on parallel machines
• Solving zero-sum games using best-response oracles with applications to search games
• Structure of a simple scheduling polyhedron
• The expanding search ratio of a graph
• The theory of search games and rendezvous.
• Weighted network search games with multiple hidden objects and multiple search teams

Cited in

(4)

• A monotone iterative method for solving the combinatorial game-type optimization problems on permutations
• scientific article; zbMATH DE number 1789317 (Why is no real title available?)
• Polytope-form games and index/degree theories for extensive-form games
• A Game Theoretic Approach to a Problem in Polymatroid Maximization

This page was built for publication: A game theoretic approach to a problem in polymatroid maximization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2098075)