Congestion Games with Polytopal Strategy Spaces
暂无分享,去创建一个
[1] Albert Atserias,et al. On digraph coloring problems and treewidth duality , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).
[2] Daniel Bienstock,et al. On embedding graphs in trees , 1990, J. Comb. Theory, Ser. B.
[3] Bruce A. Reed,et al. Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width , 2003, J. Algorithms.
[4] Xiaotie Deng,et al. Settling the complexity of computing two-player Nash equilibria , 2007, JACM.
[5] Paul R. Milgrom,et al. Designing Random Allocation Mechanisms: Theory and Applications , 2013 .
[6] J. Nash. NON-COOPERATIVE GAMES , 1951, Classics in Game Theory.
[7] Christos H. Papadimitriou,et al. Three-Player Games Are Hard , 2005, Electron. Colloquium Comput. Complex..
[8] Alan J. Hoffman,et al. Integral Boundary Points of Convex Polyhedra , 2010, 50 Years of Integer Programming.
[9] Kevin Leyton-Brown,et al. Action-Graph Games , 2011, Games Econ. Behav..
[10] Christos H. Papadimitriou,et al. The Game World Is Flat: The Complexity of Nash Equilibria in Succinct Games , 2006, ICALP.
[11] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[12] Christos H. Papadimitriou,et al. The complexity of pure Nash equilibria , 2004, STOC '04.
[13] Alberto Del Pia,et al. Totally Unimodular Congestion Games , 2015, SODA.
[14] Yoav Shoham,et al. Fast and Compact: A Simple Class of Congestion Games , 2005, AAAI.
[15] Siddharth Barman,et al. Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem , 2015, STOC.
[16] R. Rosenthal. A class of games possessing pure-strategy Nash equilibria , 1973 .
[17] Constantinos Daskalakis,et al. On the complexity of Nash equilibria of action-graph games , 2009, SODA.