Publication:3549721
From MaRDI portal
zbMath1231.91062MaRDI QIDQ3549721
Aaron Roth, Katrina Ligett, Mohammad Taghi Hajiaghayi, Avrim L. Blum
Publication date: 5 January 2009
Related Items
On Learning Algorithms for Nash Equilibria, Generalized mirror descents in congestion games, Learning in auctions: regret is hard, envy is easy, Price of Anarchy for the N-Player Competitive Cascade Game with Submodular Activation Functions, Load balancing without regret in the bulletin board model, Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness, Bounding the inefficiency of outcomes in generalized second price auctions, Equilibria of Greedy Combinatorial Auctions, Competitive routing over time, The Price of Stochastic Anarchy, FIFO and randomized competitive packet routing games, Small-Loss Bounds for Online Learning with Partial Information