Mixture Selection, Mechanism Design, and Signaling
IEEE Symposium on Foundations of Computer Science, pp. 1426-1445, 2015.
We pose and study a fundamental algorithmic problem which we term mixture selection, arising as a building block in a number of game-theoretic applications: Given a function g from the n-dimensional hypercube to the bounded interval [-1, 1], and an n × m matrix A with bounded entries, maximize g(Ax) over x in the m-dimensional simplex. Th...More
PPT (Upload PPT)