This paper contains several results regarding the communication complexity model and the 2-prover games model, which are based on interaction between the two models:
We study a classical problem in online scheduling. A sequence of jobs must be scheduled on m identical parallel machines. As each job arrives, its processing time is known. The goa...