scientific article; zbMATH DE number 2086670
From MaRDI portal
Publication:4737207
zbMath1057.90018MaRDI QIDQ4737207
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Games involving graphs (91A43) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (9)
Stackelberg thresholds in network routing games or the value of altruism ⋮ Efficient coordination mechanisms for unrelated machine scheduling ⋮ The price of optimum: complexity and approximation for a matching game ⋮ Stackelberg strategies and collusion in network games with splittable flow ⋮ Stackelberg strategies for atomic congestion games ⋮ Achieving target equilibria in network routing games without knowing the latency functions ⋮ The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions ⋮ On Stackelberg strategies in affine congestion games ⋮ Enforcing efficient equilibria in network design games via subsidies
This page was built for publication:
