Scheduling to maximize participation

Authors:
Ioannis Caragiannis;Christos Kaklamanis;Panagiotis Kanellopoulos;Evi Papaioannou
Affiliations:
Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece;Research Academic Computer Technology Institute and Department of Computer Engineering and Informatics, University of Patras, 26500 Rio, Greece
Venue:
Theoretical Computer Science
Year:
2008

Citing 18
Cited 0

Randomized algorithms

Randomized algorithms
Efficient on-line call control algorithms

Journal of Algorithms
Online computation and competitive analysis

Online computation and competitive analysis
Competitive non-preemptive call control

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The price of selfish routing

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms, games, and the internet

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
How bad is selfish routing?

Journal of the ACM (JACM)
Tight bounds for worst-case equilibria

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game

ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Handbook of Scheduling: Algorithms, Models, and Performance Analysis
The Price of Routing Unsplittable Flow

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
An improved approximation algorithm for combinatorial auctions with submodular bidders

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On maximizing welfare when utility functions are subadditive

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Approximation algorithms for allocation problems: Improving the factor of 1 - 1/e

FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs

Discrete Applied Mathematics
Worst-case equilibria

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Tight bounds for selfish and greedy load balancing

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Quantified Score

Hi-index	5.23

Visualization

Abstract

We study a problem of scheduling client requests to servers. Each client has a particular latency requirement at each server and may choose either to be assigned to some server in order to get serviced provided that her latency requirement is met, or not to participate in the assignment at all. From a global perspective, in order to optimize the performance of such a system, one would aim to maximize the number of clients that participate in the assignment. However, clients may behave selfishly in the sense that, each of them simply aims to participate in an assignment and get serviced by some server where her latency requirement is met with no regard to overall system performance. We model this selfish behavior as a strategic game, show how to compute pure Nash equilibria efficiently, and assess the impact of selfishness on system performance. We also show that the problem of optimizing performance is computationally hard to solve, even in a coordinated way, and present efficient approximation and online algorithms.