Editor's introduction

I am very happy to introduce Issue 8.2 of SIGecom Exchanges. The first four contributions concern game theory. The first contribution is a full-length paper by Demaine, Hajiaghayi, Mahini, and Zadimoghaddam, titled "The Price of Anarchy in Cooperative Network Creation Games." In it, they study network creation games, in which the nodes of a graph decide which edges to create. They study "collaborative equilibrium" in which coalitions do not want to change their collective strategy on a single edge, and analyze the price of anarchy in this model. In "Computing Shapley's Saddles," Brandt, Brill, Fischer, Harrenstein, and Hoffmann discuss the computational complexity of saddles, an ordinal, set-valued solution concept defined by Shapley. In "A Prescriptive Approach for Playing Games," Feldman gives an overview of two recent papers on two-player zero-sum games: one of these papers considers a model in which the randomization phase of a randomized strategy is not completely private, and the other considers repeated symmetric games in which one player never observes a single payoff (but does observe the opponent's play). Finally, Pita, Bellamane, Jain, Kiekintveld, Tsai, Ordóñez, and Tambe consider some real-world applications of game theory at Los Angeles International Airport and the US Federal Air Marshals, and discuss some of the challenges in applying game theory to practice, in their letter "Security Applications: Lessons of Real-World Deployment".