teaching:ipcomsoc2324
Rozdíly
Zde můžete vidět rozdíly mezi vybranou verzí a aktuální verzí dané stránky.
Následující verze | Předchozí verze | ||
teaching:ipcomsoc2324 [2024/02/23 02:09] – vytvořeno Martin Koutecky | teaching:ipcomsoc2324 [2024/05/17 15:10] (aktuální) – Martin Koutecky | ||
---|---|---|---|
Řádek 3: | Řádek 3: | ||
This is essentially another iteration of the [[: | This is essentially another iteration of the [[: | ||
+ | |||
+ | {{tablelayout? | ||
+ | ^ data ^ what was taught [resources] ^ | ||
+ | | 26. 2. | Fixed dimension IPs, intro to iterative augmentation. **[LN up to Lemma 7]** | | ||
+ | | 4. 3. | More details for iterative augmentation. **[LN up to Lemma 16]**| | ||
+ | | 11. 3. | Norm bound, DP for case of small $m$ and $\|A\|_\infty$ **[LN Lemma 16, 17]**; treedepth, block-structured matrices **[LN 3.4]**; norm bound for $n$-fold IPs **[LN Lemma 29]**| | ||
+ | | 18. 3. | norm bounds and augmentation IP algorithms for $n$-fold and $2$-stage stochastic IPs [LN 3.5.1 and 3.6]| | ||
+ | | 25. 3. | Extensions: proximity theorems, coefficient reduction, strongly-poly algorithms, sensitivity [LN 4 + 5]| | ||
+ | | 1. 4. | //Easter Monday//| | ||
+ | | 8. 4. | Intro to voting: election, voting rule, some examples **[LN 6.1-6.3]**; <typo fv: | ||
+ | | 15. 4. | //Cancelled - KAM/IUUK spring school//| | ||
+ | | 22. 4. | Bribery and manipulation actions as moves in societies, various voting rules, FPT algorithms.| | ||
+ | | 29. 4. | More voting rules; what's the deal with Young-< | ||
+ | | 6. 5. | Cooper' | ||
+ | | 13. 5. | Opinion diffusion| | ||
+ | | 20. 5. | Wrap up| | ||
+ | |||
+ | |||
+ | ==== Resources: ==== | ||
+ | |||
+ | |||
+ | * **{{ : | ||
+ | |||
Eventually I will post lecture notes here. | Eventually I will post lecture notes here. |
teaching/ipcomsoc2324.1708650567.txt.gz · Poslední úprava: 2024/02/23 02:09 autor: Martin Koutecky