The Price of Anarchy for Minsum Related Machine Scheduling

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-29116-6_22
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

The Anarchy of Scheduling Without Money

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

The Price of Anarchy for Restricted Parallel Links

Parallel Processing Letters
HardwareTheoretical Computer ScienceArchitectureSoftware
2006English

Selfish Routing and the Price of Anarchy

2006English

The Price of Anarchy in Network Creation Games

2007English

Nash Equilibria and the Price of Anarchy for Flows Over Time

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2010English

Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Topological Price of Anarchy Bounds for Clustering Games on Networks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

The Strong Price of Anarchy of Linear Bottleneck Congestion Games

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2014English

The Price of Anarchy and the Design of Scalable Resource Allocation Mechanisms

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy