Scheduling to Maximize Participation

DOI10.1007/978-3-540-75336-0_14zbMath1211.68033OpenAlexW1760646185MaRDI QIDQ3608460

Panagiotis Kanellopoulos, Ioannis Caragiannis, Evi Papaioannou, Christos Kaklamanis

Publication date: 5 March 2009

Published in: Trustworthy Global Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75336-0_14

Mathematics Subject Classification ID

Applications of game theory (91A80) 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
• Unnamed Item
• Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
• Approximate equilibria and ball fusion
• On maximizing welfare when utility functions are subadditive
• 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