Stackelberg bipartite vertex cover and the preflow algorithm

DOI10.1007/s00453-015-9993-xzbMath1334.91020OpenAlexW2054594286MaRDI QIDQ270027

Francisco Barahona, Mourad Baïou

Publication date: 6 April 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-9993-x

zbMATH Keywords

bipartite vertex coverpreflow algorithmStackelberg vertex cover

Mathematics Subject Classification ID

Hierarchical games (including Stackelberg games) (91A65) Games involving graphs (91A43)

Related Items (5)

On the Complexity of Stackelberg Matroid Pricing Problems ⋮ Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem ⋮ Revenue maximization in Stackelberg pricing games: beyond the combinatorial setting ⋮ Stackelberg packing games ⋮ Stackelberg Max Closure with Multiple Followers

Cites Work

• The Stackelberg minimum spanning tree game
• Stackelberg network pricing games
• An overview of Stackelberg pricing in networks
• A Bilevel Model of Taxation and Its Application to Optimal Highway Pricing
• Stackelberg network pricing is hard to approximate
• PRICING GEOMETRIC TRANSPORTATION NETWORKS
• A new approach to the maximum-flow problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• On stackelberg pricing with computationally bounded customers
• A Fast Parametric Maximum Flow Algorithm and Applications
• An approximation algorithm for Stackelberg network pricing
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stackelberg bipartite vertex cover and the preflow algorithm