Dagstuhl Seminar on Algorithmic Combinatorial Game Theory. Seminar no. 02081, report no. 334, March 17{22, 2002.E.D. Demaine, R. Fleischer, A. Fraenkel, R. Nowakowski (organizers), Dagstuhl Seminar on Algorithmic Combinatorial Game Theory, Seminar No. 02081, Report No. 334, March 17-22,...
Open Problems at the 2002 Dagstuhl Seminaron Algorithmic Combinatorial Game TheoryErik D. DemaineMIT Laboratory for Computer Science, Cambridge, MA 02139, USAemail: edemaine@mit. eduRudolf FleischerHKUST Department of Computer Science, Clear Water Bay, Kowloon, HongKongemail: rudolf@cs. ust. hkAvie...
Minimization 4.4 Regret Minimization and Game Theory 4.5 Generic Reduction from External to Swap Regret 4.6 The Partial Information Model 4.7 On Convergence of Regret-Minimizing Strategies to Nash Equilibrium in Routing Games 4.8 Notes Bibliography Exercises 5 Combinatorial Algorithms for Market Equilibria ...
他的书和课都用了很大篇幅；稍微基础一点的cs261(combinatorial optimization)里面，他也讲到了一些game，...
especially on Internet- and e-commerce-related issues. More than 40 of the top researchers in this field have written chapters that go from the foundations to the state of the art. Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by c...
5 - Combinatorial Algorithms for Market Equilibria 6 - Computation of Market Equilibria by Convex Programming 7 - Graphical Games 8 - Cryptography and Game Theory 9 - Introduction to Mechanism Design (for Computer Scientists) 10 - Mechanism Design without Money 11 - Combinatorial Auctions 12 - Comp...
Algorithmic game theory is the research area in the interface between the theories of algorithms, networks, and games, which emerged more than a decade ago motivated by the advent of the Internet. “Snapshot” means several things: very personal point of view, of topical and possibly ephemeral...
Basic chapters on algorithmic methods for equilibria, mechanism design and combinatorial auctions are followed by chapters on incentives and pricing, cost sharing, information markets and cryptography and security. Students, researchers and practitioners alike need to learn more about these fascinating ...
Orlin, 2009: Strongly polynomial algorithm for Fisher’s linear case. Open: For rest. AGT&E’s gift to theory of algorithms! New complexity classes: PPAD, FIXP Study complexity of total problems A new algorithmic direction Combinatorial algorithms for convex programs...
economics. Robustness of learning algorithms to adversarial agents. Artificial neural networks, including deep learning. High-dimensional and non-parametric statistics. Adaptive data analysis and selective inference. Learning with algebraic or combinatorial structure. Bayesian methods in learning. Learning in ...