https://wiki.devclub.in/index.php?action=history&feed=atom&title=COL755 2026-04-09T06:02:54Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=COL755&diff=591&oldid=prev 2026-03-04T10:00:12Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = COL755<br /> | name = Algorithmic Game Theory<br /> | credits = 3<br /> | credit_structure = 3-0-0<br /> | pre_requisites = COL351<br /> | overlaps = <br /> }}<br /> <br /> == COL755 : Algorithmic Game Theory ==<br /> Games, Strategies, Costs, Payoff, Solution Concepts. Pure and Mixed Nash Equilibria. Two player Zero-Sum Games and Proof of Nash Equilibria using Linear Programming Duality. Nash&#039;s theorem using FPT&#039;s. Complexity of finding Nash Equilibrium, Lemke Howson Algorithm, The Class PPAD. Hierarchy of Equilibria, Best-case and strong Nash Equilibria, Best-response dynamics, and no-regret dynamics. Social Choice, Arrow&#039;s and Gibbard-Satherthwaite theorems. Auctions and Optimal Mechanism Design, Myerson&#039;s lemma, VCG mechanisms. Revenue maximizing Auctions. Inefficiency of Equilibria. Price of Anarchy in network routing games, Atomic routing games, Potential function games. Mechanism Design without money: Stable matchings. Market equilibria and their computation, Fisher&#039;s and Arrow-Debreu Models, Eisenberg-Gale convex program.</div>

Prashantt492