scientific article

From MaRDI portal
Publication:3524729

zbMath1151.91322MaRDI QIDQ3524729

Berthold Vöcking

Publication date: 12 September 2008


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (28)

Concurrent imitation dynamics in congestion gamesEfficient coordination mechanisms for unrelated machine schedulingStrong equilibria in games with the lexicographical improvement propertyCost-sharing scheduling games on restricted unrelated machinesEfficiency analysis with respect to the unit cost objectives in scheduling gamesNonpreemptive coordination mechanisms for identical machinesReducing price of anarchy of selfish task allocation with more selfishnessSmoothed performance guarantees for local searchOn Submodular Search and Machine SchedulingThe power of one evil secret agentThe efficiency of Nash equilibria in the load balancing game with a randomizing schedulerThe strong price of anarchy of linear bottleneck congestion gamesEfficiency analysis of load balancing games with and without activation costsPerformance guarantees of jump neighborhoods on restricted related parallel machinesDistributed Learning of Wardrop EquilibriaStrong stability of Nash equilibria in load balancing gamesConvergence of best-response dynamics in games with conflicting congestion effectsSymmetry exploitation for online machine covering with bounded migrationAssignment games with conflicts: robust price of anarchy and convergence results via semi-smoothnessColocating tasks in data centers using a side-effects performance modelSurrogate optimization for \(p\)-normsTwo-group knapsack gameCompetitive routing over timeMeasurement-based efficient resource allocation with demand-side adjustmentsLoad rebalancing games in dynamic systems with migration costsProject gamesImproved price of anarchy for machine scheduling games with coordination mechanismsA unifying approximate potential for weighted congestion games




This page was built for publication: