Scheduling to maximize participation
From MaRDI portal
Publication:935466
DOI10.1016/j.tcs.2008.04.031zbMath1146.68024OpenAlexW1993957838MaRDI QIDQ935466
Christos Kaklamanis, Evi Papaioannou, Ioannis Caragiannis, Panagiotis Kanellopoulos
Publication date: 6 August 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.04.031
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
- Approximate equilibria and ball fusion
- Congestion games with player-specific payoff functions
- On maximizing welfare when utility functions are subadditive
- Efficient On-Line Call Control Algorithms
- How bad is selfish routing?
- The price of anarchy of finite congestion games
- An improved approximation algorithm for combinatorial auctions with submodular bidders
- Tight Bounds for Selfish and Greedy Load Balancing
- Edge Dominating Sets in Graphs
- The price of selfish routing
- Algorithms, games, and the internet
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- The Price of Routing Unsplittable Flow
- On-line competitive algorithms for call admission in optical networks
This page was built for publication: Scheduling to maximize participation