We consider the online distributed non-stochastic experts problem, where the distributed system consists of one coordinator node that is connected to k sites, and the sites are required to communicate with each other via the coordinator. At each time-step t, one of the k site nodes has to pick an expert from the set {1, . . . , n}, and the same site receives information about payoffs of all exp...

Consider an environment where long-lived experts repeatedly interact with shortlived customers. In periods when an expert is hired, she chooses between providing a profitable major treatment or a less profitable minor treatment. The expert has private information about which treatment best serves the customer, but has no direct incentive to act in the customer’s interest. Customers can observe ...