Publication:4952670

zbMath0962.91001MaRDI QIDQ4952670

Todd A. Gormley, Jeffery Westbrook, Eric Torng, Nicholas Reingold

Publication date: 23 October 2000

zbMATH Keywords

game trees; adversary request nodes; adversary strategies; online move nodes; request-answer games

Mathematics Subject Classification ID

91A10: Noncooperative games

90C05: Linear programming

91A05: 2-person games

Related Items

Semi-online scheduling revisited, Online scheduling with rejection and reordering: exact algorithms for unit size jobs, Semi-on-line multiprocessor scheduling with given total processing time, Online scheduling with rejection and withdrawal, Online scheduling with a buffer on related machines, List's worst-average-case or WAC ratio, Optimal on-line algorithms to minimize makespan on two machines with resource augmentation, Randomized priority algorithms, Resource augmentation in load balancing., Applying extra-resource analysis to load balancing., On-line scheduling revisited, Minimizing the maximum starting time on-line, Online makespan minimization with parallel schedules, Separating online scheduling algorithms with the relative worst order ratio, Improved lower bounds for the online bin stretching problem, Approximation and online algorithms for multidimensional bin packing: a survey, On the value of job migration in online makespan minimization, Load balancing of temporary tasks in the \(\ell _{p}\) norm