<--- Back to Details
First PageDocument Content
Formal sciences / Cybernetics / Algorithmic game theory / Game theory / Theory of computation / Algorithmic / Mathematical optimization / Machine learning / John von Neumann / Theoretical computer science
Date: 2012-04-18 05:31:51
Formal sciences
Cybernetics
Algorithmic game theory
Game theory
Theory of computation
Algorithmic
Mathematical optimization
Machine learning
John von Neumann
Theoretical computer science

Microsoft Word - Pelillo.doc

Add to Reading List

Source URL: svg.dmi.unict.it

Download Document from Source Website

File Size: 40,59 KB

Share Document on Facebook

Similar Documents

CS364A: Algorithmic Game Theory Lecture #15: Best-Case and Strong Nash Equilibria∗ Tim Roughgarden† November 11,

DocID: 1tO19 - View Document

CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time

DocID: 1tNIR - View Document

CS364A: Algorithmic Game Theory Lecture #18: From External Regret to Swap Regret and the Minimax Theorem∗ Tim Roughgarden† November 20, 2013

DocID: 1tNkR - View Document

An Algorithmic Game Theory Primer∗ Tim Roughgarden† June 21, 2008 Abstract We give a brief and biased survey of the past, present, and future of research on the interface

DocID: 1tNe6 - View Document