Combinatorial Optimization and Applications
暂无分享,去创建一个
[1] Christos H. Papadimitriou,et al. Worst-case equilibria , 1999 .
[2] Berthold Vöcking,et al. Tight bounds for worst-case equilibria , 2002, SODA '02.
[3] Nguyen Kim Thang,et al. Lagrangian Duality in Online Scheduling with Resource Augmentation and Speed Scaling , 2013, ESA.
[4] Haim Kaplan,et al. Strong Price of Anarchy for Machine Load Balancing , 2007, ICALP.
[5] Carsten Lund,et al. On the hardness of approximating minimization problems , 1993, STOC.
[6] Amit Sahai,et al. Coding Constructions for Blacklisting Problems without Computational Assumptions , 1999, CRYPTO.
[7] Denis Trystram,et al. Online Non-Preemptive Scheduling in a Resource Augmentation Model Based on Duality , 2016, ESA.
[8] Elias Koutsoupias,et al. The price of anarchy of finite congestion games , 2005, STOC '05.
[9] Yishay Mansour,et al. Strong price of anarchy , 2007, SODA '07.
[10] Kirk Pruhs,et al. The Price of Stochastic Anarchy , 2008, SAGT.
[11] Chaitanya Swamy,et al. Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity , 2007, EC '07.
[12] Tim Roughgarden,et al. The price of stability for network design with fair cost allocation , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.
[13] Anand Srivastav,et al. Finding Dense Subgraphs with Semidefinite Programming , 1998, APPROX.
[14] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..
[15] Paolo Penna,et al. Sequential Solutions in Machine Scheduling Games , 2016, WINE.
[16] Martin Gairing,et al. Nashification and the Coordination Ratio for a Selfish Routing Game , 2003, ICALP.
[17] Marc Uetz,et al. The Sequential Price of Anarchy for Atomic Congestion Games , 2014, WINE.
[18] Nathan Linial,et al. Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..
[19] János Pach,et al. Conflict-Free Colourings of Graphs and Hypergraphs , 2009, Combinatorics, Probability and Computing.
[20] Vijay V. Vazirani,et al. Approximation Algorithms , 2001, Springer Berlin Heidelberg.
[21] James B. Orlin,et al. Max flows in O(nm) time, or better , 2013, STOC '13.
[22] Kirk Pruhs,et al. Equilibria for two parallel links : The strong price of anarchy versus the price of anarchy , 2007 .
[23] Renato Paes Leme,et al. The curse of simultaneity , 2012, ITCS '12.
[24] Robert J. Aumann,et al. 16. Acceptable Points in General Cooperative n-Person Games , 1959 .
[25] Tami Tamir,et al. Approximate Strong Equilibrium in Job Scheduling Games , 2009, SAGT.
[26] Avi Wigderson,et al. Improving the performance guarantee for approximate graph coloring , 1983, JACM.
[27] Danny Segev,et al. Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing , 2006, ESA.
[28] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[29] Ellis Horowitz,et al. A linear time approximation algorithm for multiprocessor scheduling , 1979 .
[30] Paul G. Spirakis,et al. Approximate Equilibria and Ball Fusion , 2003, Theory of Computing Systems.
[31] David P. Williamson,et al. The Design of Approximation Algorithms , 2011 .
[32] Steve Chien,et al. Strong and Pareto Price of Anarchy in Congestion Games , 2009, ICALP.
[33] Miklós Ruszinkó,et al. On the Upper Bound of the Size of the R-Cover-Free Families , 1993, Proceedings. IEEE International Symposium on Information Theory.
[34] Gábor Tardos,et al. A constructive proof of the general lovász local lemma , 2009, JACM.
[35] Ely Porat,et al. Exact and Approximate Pattern Matching in the Streaming Model , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[36] Éva Tardos,et al. Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract , 2009, STOC '09.
[37] Christos H. Papadimitriou,et al. Beyond competitive analysis [on-line algorithms] , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.
[38] Peter J. Stuckey,et al. Propagation via lazy clause generation , 2009, Constraints.
[39] Vittorio Bilò,et al. Some Anomalies of Farsighted Strategic Behavior , 2012, Theory of Computing Systems.
[40] Ojas Parekh,et al. A Unified Approach to Approximating Partial Covering Problems , 2006, ESA.
[41] Cynthia A. Phillips,et al. Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.
[42] Yossi Azar,et al. Tradeoffs in worst-case equilibria , 2003, Theor. Comput. Sci..
[43] Marios Mavronicolas,et al. The Price of Anarchy for Restricted Parallel Links , 2006, Parallel Process. Lett..