Scheduling to maximize participation

DOI10.1016/J.TCS.2008.04.031MaRDI QIDQ935466zbMATH OpenOpenAlexFDO

Authors I. Caragiannis, C. Kaklamanis, Panagiotis Kanellopoulos, Evi Papaioannou

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

zbMATH Keywords

competitive analysisschedulingNash equilibriaapproximation and online algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Scheduling to Maximize Participation
• Optimal schedules for periodically recurring events
• Technical Note—Optimal Scheduling of Periodic Activities
• Scheduling to Minimize Maximum Workload
• Online interval scheduling to maximize total satisfaction
• Online Interval Scheduling to Maximize Total Satisfaction
• Les problèmes d'ordonnancement
• Scheduling problems
• scientific article; zbMATH DE number 874563

Cites work

• scientific article; zbMATH DE number 1003262 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2038735 (Why is no real title available?)
• scientific article; zbMATH DE number 2086616 (Why is no real title available?)
• scientific article; zbMATH DE number 2109192 (Why is no real title available?)
• scientific article; zbMATH DE number 2119691 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• Algorithms, games, and the internet
• An improved approximation algorithm for combinatorial auctions with submodular bidders
• Approximate equilibria and ball fusion
• Congestion games with player-specific payoff functions
• Edge Dominating Sets in Graphs
• Efficient On-Line Call Control Algorithms
• How bad is selfish routing?
• On maximizing welfare when utility functions are subadditive
• On the complexity of approximating \(k\)-dimensional matching
• On-line competitive algorithms for call admission in optical networks
• Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
• The price of anarchy of finite congestion games
• The price of routing unsplittable flow
• The price of selfish routing
• Tight Bounds for Selfish and Greedy Load Balancing
• Worst-case equilibria

Cited in

(1)

• Scheduling to Maximize Participation

This page was built for publication: Scheduling to maximize participation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q935466)