Charles Explorer logo
🇨🇿

Celočíselné programování a výpočetní aspekty voleb

Předmět na Matematicko-fyzikální fakulta |
NTIN113

Tento text není v aktuálním jazyce dostupný. Zobrazuje se verze "en".Sylabus

- Lenstra's algorithm (fixed-dimension IP)

- Graver basis definitions, properties, bounds, generic iterative augmentation algorithm

- n-fold and 2-stage stochastic IPs, treedepth generalization

- elections, voting rules, bribery problems

- opinion diffusion

- campaigning and Cooper's algorithm for Presburger Arithmetic

Tento text není v aktuálním jazyce dostupný. Zobrazuje se verze "en".Anotace

Integer Programming is an optimization tool rich both in theory and applications. Computational Social Choice is a field of growing relevance which considers the computational aspects of elections, fair divison, opinion dynamics, etc.

In this course, we will describe algorithms for important IP and IP-related problems, and show their applications to problems from computational social choice.