Algorithmic Aspects of Discrete Choice in Convex Optimization
- 132 pages
- 5 hours of reading
Focusing on the intersection of discrete choice models and convex optimization, this book introduces a framework that derives new prox-functions from discrete choice surplus functions. It explores their integration into convex optimization schemes and presents various economic applications, including network manipulation through alternating minimization and dynamic pricing strategies for online marketplaces. The work emphasizes the practical implications of these concepts in optimizing decision-making processes.

