The price of optimum in a matching game

DOI10.1007/978-3-642-24829-0_9MaRDI QIDQ3095261zbMATH OpenOpenAlexFDO

Authors Bruno Escoffier, Laurent Gourvès, Jérôme Monnot

Publication date 28 October 2011

Published in Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-24829-0_9

Mathematics Subject Classification ID

Applications of game theory (91A80) Hierarchical games (including Stackelberg games) (91A65) Matching models (91B68)

Recommendations

• The price of optimum: complexity and approximation for a matching game
• Stackelberg strategies for network design games
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• On Stackelberg strategies in affine congestion games
• On Stackelberg strategies in affine congestion games

Cited in

(4)

• Opportunity costs in the game of best choice
• Stackelberg strategies on epidemic containment games
• The price of optimum: complexity and approximation for a matching game
• Price of Competition and Dueling Games

This page was built for publication: The price of optimum in a matching game

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