In many practical control problems (e.g. in the power grid/traffic flow) agents are not able to effectively coordinate their actions. One classical method proposed by economists for solving such decentralized control problems is known as the ficticious play algorithm. This talk will discuss some recent work which establishes converge rates for ficticious play. In particular, ideas relating to differential inclusions, regular Lagrangian flows and nonsmooth gradient flows will be discussed.