Graph theory and combinatorics

WORKING PAPERS q C. Borgs, J. Chayes, N. Immorlica, A. Kalai, V. S. Mirrokni and C. Papadimitriou, The Myth of the Folk Theorem, submitted to STOC. q U. Feige, N. Immorlica, V.S.Mirrokni and H. Nazerzadeh, Functional Approximations: A new approach for analyzing Heuristics, submitted to STOC. q B. Awerbuch, Y. Azar, and A. Epstein, V. S. Mirrokni, A. Skopalik, Fast Convergence to Nearly Optimal Solutions in Potential Games, submitted to STOC. q J. Hartline, V. S. Mirrokni, and M. Sundararajan, Marketing Strategies over Social Networks, submitted to WWW. q U. Feige, N. Immorlica, V.S. Mirrokni and H. Nazerzadeh, Combinatorial Allocation Mechanisms with Penalties for Banner Advertisement, submitted to WWW. q R. Andersen, C. Borgs, J. Chayes, U. Feige, A. Flaxman, A. Kalai, V. S. Mirrokni, M. Tennenholtz, Trust-based Recommendation Systems: An axiomatic Approach, submitted to WWW. q V. S. Mirrokni, M. Schapira, J. Vondrak, Tight Information-Theoretic Lower Bounds for Maximizing Social-Welfare in Combinatorial Auctions, submitted to IPCO. q M. Goemans, N. Harvey, R. Kleinberg, V. S. Mirrokni, On Learning submodular functions, to be submitted to ICALP. q H. Ackermann, P. Goldberg, V. S. Mirrokni, H. Roeglin, and B. Voecking, Uncoordinated Twosided Markets, to be submitted to ACM EC. q M. Ghodsi, M. Mahini, V. S. Mirrokni, and M. ZadiMoghaddam Singleton Betting for Permutation Betting Markets. q R. Andersen, C. Borgs, J. Chayes, K. Jain, J. Hopcroft, V. S. Mirrokni and S. Teng, Locally Computable Link Spam Features. q V.S. Mirrokni, A. Skopalik, On the Complexity of Nash Dynamics and Sink Equilibria. q R. Andersen, V. S. Mirrokni, Overlapping Clustering for Distributed Computation.