New polyhedral and algorithmic results on greedoids

DOI10.1007/s10107-019-01427-7zbMath1462.90113arXiv1811.04690OpenAlexW3101203563WikidataQ127331467 ScholiaQ127331467MaRDI QIDQ2220660

Dávid Szeszlér

Publication date: 25 January 2021

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.04690

zbMATH Keywords

Nash equilibriumsecuritymatroidgreedoid

Mathematics Subject Classification ID

Applications of game theory (91A80) Combinatorial optimization (90C27)

Related Items (1)

Sufficient conditions for the optimality of the greedy algorithm in greedoids

Cites Work

• Unnamed Item
• Security games on matroids
• Faster algorithms for security games on matroids
• Greedoids
• A characterization of undirected branching greedoids
• A greedy algorithm for interval greedoids
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Game-theoretic Robustness of Many-to-one Networks
• Greedoids and Linear Objective Functions
• Optimal attack and reinforcement of a network
• An Exact Characterization of Greedy Structures
• Matroids and the greedy algorithm

This page was built for publication: New polyhedral and algorithmic results on greedoids