Mixture Selection, Mechanism Design, and Signaling

IEEE Symposium on Foundations of Computer Science, pp. 1426-1445, 2015.

Cited by: 30|Bibtex|Views61|DOI:https://doi.org/10.1109/FOCS.2015.91
EI
Other Links: academic.microsoft.com|dblp.uni-trier.de|dl.acm.org|arxiv.org

Abstract:

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

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments