READING GROUP: Fall 2007

---

SCHEDULE:

• September 14, 2007  - Room 32-D677 @ 1:00 p.m. : Paul Njoroge on:
• Matthew O. Jackson, "Mechanism Theory".

• September 21, 2007 – Room 32-D707@1:00 p.m.: Ilan Lobel and Parikshit Shah on:
• D. C. Parkes, S. Singh, D. Yanovsky, “Approximately Efficient Mechanism Design.”
• D. C. Parkes, S. Singh, “An MDP-Based Approach to Online Mechanism Design.”

• Oct. 5, 2007- Room 32-D677 @ 1:00p.m. : Kostas Bimpikis on:
• B. Edelman, M. Ostrovsky, and M. Schwarz, “Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords.”

• Oct. 12, 2007- Room 32-D677 @ 1:00p.m. : Dan Iancu on:
• T.S. Jaakkola, “Tutorial on variational approximation methods.”

• Oct. 19, 2007- Room 32-D677 @ 2:00p.m. : Mesrob Ohanessian on:
• M.J. Wainwright, M.I. Jordan, “Graphical Models, Exponential Families, and Variational Inference.”

(Please note the departure from our usual time.)

• Oct. 26, 2007- Room 32-D677 @ 1:00p.m. : Mesrob Ohanessian to continue on:
• M.J. Wainwright, M.I. Jordan, “Graphical Models, Exponential Families, and Variational Inference.”

• Nov. 2, 2007- Room 32-D677 @ 1:00p.m. : Sujay Sanghavi on :
• S. Sanghavi, “Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs.” 

• Nov. 9, 2007- Room 32-D677 @ 11:00a.m. : Michael Rinehart on :
• S. M. Aji, R. J. McEliece, “The Generalized Distributive Law”, IEEE Trans. Info. Theory.

(Please note our new time.)

---

COMPLETE READING LIST:

• Mechanism Design:

• Matthew O. Jackson, "Mechanism Theory".
• D. C. Parkes, S. Singh, D. Yanovsky, “Approximately Efficient Mechanism Design.”
• D. C. Parkes, S. Singh, “An MDP-Based Approach to Online Mechanism Design.”
• M. T. Hajiaghayi, R. Kleinberg, D. C. Parkes, “Adaptive Limited-Supply Online Auctions.”
• M. T. Hajiaghayi, R. Kleinberg, M. Mahdian, D. C. Parkes, “Online Auctions with Re-usable Goods.”
• S. Athey, I. Segal, “An Efficient Dynamic Mechanism.”
• J. Gallien, “Dynamic Mechanism Design for Online Commerce.”

• Message Passing and Belief Propagation:

• F. R. Kshischang, B. J. Frey, H. A. Loeliger: “Factor Graphs and the Sum-Product Algorithm”, IEEE Trans. Info. Theory.
• S. M. Aji, R. J. McEliece, “The Generalized Distributive Law”, IEEE Trans. Info. Theory.

• T.S. Jaakkola, “Tutorial on variational approximation methods.”
• M.J. Wainwright, M.I. Jordan, “Graphical Models, Exponential Families, and Variational Inference.”
• S. Sanghavi, “Equivalence of LP Relaxation and Max-Product for Weighted Matching in General Graphs.” 

• Nonsmooth Optimization: (bundle methods, gradient sampling, proximal methods etc.)

• Krzysztof C. Kiwiel, “An aggregate subgradient method for convex nonsmooth minimization,” Math. Programming, 1983.
• Krzysztof C. Kiwiel, “Proximity control in bundle methods for convex nonsmooth optimization,” Math. Programming, vol. 46, 105-122, 1990.
• Krzysztof C. Kiwiel, “Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities,” Math. Program. 69: 89-109, 1995.
• C. Helmberg and F. Rendl, “A Spectral Bundle Method for Semidefinite Programming,” SIAM Journal on Optimization, vol. 10 ,  Issue 3, 1999.
• J.V. Burke, A.S. Lewis and M.L. Overton, “A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization,” SIAM J. Optimization 15, pp. 751-779, 2005.
• A.S.Lewis and M.L.Overton, “Eigenvalue Optimization,” Acta Numerica 5, pp. 149-190, 1996.

• Control:

______________________________________________________________________________________________________________________

Fall 2006 Reading List