Learning convex partitions and computing game-theoretic equilibria from best response queries
Suppose that an m-simplex is partitioned into n convex regions having disjoint interiors and distinct labels, and we may learn the label of any point by querying it. The learning objective is to know, for any point in the simplex, a label that occurs within some distance ε from that point. We pre...
| Main Authors: | , |
|---|---|
| Format: | Conference item |
| Published: |
Springer, Cham
2018
|