Scheduling to Maximize Participation
From MaRDI portal
Publication:3608460
DOI10.1007/978-3-540-75336-0_14zbMATH Open1211.68033OpenAlexW1760646185MaRDI QIDQ3608460FDOQ3608460
Authors: I. Caragiannis, C. Kaklamanis, Panagiotis Kanellopoulos, Evi Papaioannou 
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
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
Applications of game theory (91A80) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Worst-case equilibria
- How bad is selfish routing?
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate equilibria and ball fusion
- The price of anarchy of finite congestion games
- Tight Bounds for Selfish and Greedy Load Balancing
- Edge Dominating Sets in Graphs
- Title not available (Why is that?)
- Algorithms, games, and the internet
- The price of routing unsplittable flow
- On maximizing welfare when utility functions are subadditive
- Title not available (Why is that?)
- The price of selfish routing
- Title not available (Why is that?)
- An improved approximation algorithm for combinatorial auctions with submodular bidders
- Randomized on-line algorithms and lower bounds for computing large independent sets in disk graphs
- On-line competitive algorithms for call admission in optical networks
- On the complexity of approximating \(k\)-dimensional matching
- The submodular welfare problem with demand queries
Cited In (1)
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 Q3608460)
