Sign inSign in
ConceptAI & ML

ϵ\epsilon-LS-PAV

An epsilon-approximate local search algorithm for Proportional Approval Voting that starts with a committee and repeatedly performs local swaps that improve the PAV score by at least epsilon.
as Edith Elkind defines itNorthwestern University
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

Lecturers

1

    Connections

    4

    The lectures that define it or assume it, and the concepts next to it.

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.