scientific article; zbMATH DE number 2086670

MaRDI QIDQ4737207zbMATH OpenFDO

Authors V. S. Anil Kumar, Madhav V. Marathe

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2380/23800776.htm

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Games involving graphs (91A43)

Recommendations

• Stackelberg scheduling strategies
• Stackelberg Scheduling Strategies
• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Experimental and Efficient Algorithms
• On Stackelberg strategies in affine congestion games

Cited in

(13)

• The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
• Achieving target equilibria in network routing games without knowing the latency functions
• On Stackelberg strategies in affine congestion games
• Enforcing efficient equilibria in network design games via subsidies
• Efficient coordination mechanisms for unrelated machine scheduling
• Stackelberg Scheduling Strategies
• Stackelberg scheduling strategies
• The price of optimum: complexity and approximation for a matching game
• Stackelberg strategies and collusion in network games with splittable flow
• Automata, Languages and Programming
• Experimental and Efficient Algorithms
• Stackelberg thresholds in network routing games or the value of altruism
• Stackelberg strategies for atomic congestion games

This page was built for publication:

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