#computation #social-choice
An example of a function (search) problem (L P, S P, R P) in terms of graph theory is: find a nondominated vertex in a directed graph, if any and find all vertices with maximum outdegree are both search problems. Solving the function problem on instance I ∈ L P consists in outputting some S ∈ S P such that (I,S) ∈ R P , if any, and “no solution” otherwise.
If you want to change selection, open document below and click on "Move attachment"
pdf
owner:
rappatoni - (no access) - CompSocBook.pdf, p36
Summary
| status | not read | | reprioritisations | |
|---|
| last reprioritisation on | | | suggested re-reading day | |
|---|
| started reading on | | | finished reading on | |
|---|
Details