https://wiki.devclub.in/index.php?action=history&feed=atom&title=COL749 2026-04-09T07:50:12Z Revision history for this page on the wiki MediaWiki 1.45.1 https://wiki.devclub.in/index.php?title=COL749&diff=585&oldid=prev 2026-03-04T10:00:07Z

<p>Creating course page via bot</p> <p><b>New page</b></p><div>{{Infobox Course<br /> | code = COL749<br /> | name = Computational Social Choice<br /> | credits = 3<br /> | credit_structure = 3-0-0<br /> | pre_requisites = COL202 (or MTL 180) &amp; COL351 (or MTL342)<br /> | overlaps = <br /> }}<br /> <br /> == COL749 : Computational Social Choice ==<br /> for UG Matchings: Deferred-acceptance algorithm and lattice structure; strategic manipulation, LP approach for fair (median) stable matchings: many-to-one matchings and rural hospitals theorem; housing markets and kidney exchange; popular matchings. Fair Division: Proportional and envy-free cake cutting; rent division via Sperner&#039;s lemma; fair allocation of indivisible goods and chores; Pareto optimality and Nash social welfare; fairness of randomised allocations. Voting: Voting rules and axioms; strategic manipulation, Gibbard- Satterthwaite theorem, computational barriers against manipulation; structured preferences. Modem paradigms: Multiwinner voting axioms and Thiele methods; rank aggregation via Kemeny rule, NP-hardness and approximation algorithms; distortion of voting rules; participatory budgeting; liquid democracy: apportionment methods and paradoxes.</div>

Prashantt492