Victor Naroditskiy

Ph.D. Candidate (expected graduation in June 2009)
Department of Computer Science
Brown University
victor@brown.edu

Advisor: Amy Greenwald


CV

Research Statement

Research Interests

My main research interests lie at the intersection of computer science and economics. In particular, I am interested in computational approaches to mechanism design, sponsored search auctions, and automated bidding agents. In my research, I combine theory with practice. On the one hand, I approach theoretical problems computationally and use simulations to assist in the derivation of theoretical results. On the other hand, I design and implement autonomous agents to automate decision making in various trading domains.
 

Publications

Conference papers and posters

  • Geoffroy de Clippel, Victor Naroditskiy, Amy Greenwald. Destroy to Save. In the 10th ACM Conference on Electronic Commerce, July 2009 (pdf)
  • Zhou, Y. and Naroditskiy, V. An Algorithm for Stochastic Multiple-Choice Knapsack Problem and Application to Keywords Bidding. In the 17th International World Wide Web Conference, April 2008 (pdf poster version)
  • Naroditskiy, V. and Greenwald, A. Using Iterated Best-Response to Find Bayes-Nash Equilibria in Auctions. In the 22nd Conference on Artificial Intelligence, July 2007 (pdf extended working version)
  • Lee, S.; Greenwald, A.; and Naroditskiy, V. RoxyBot-06: An SAA^2 TAC Travel Agent. In the 20th International Joint Conference on Artificial Intelligence, Jan 2007 (pdf)
  • Benisch, M.; Greenwald, A.; Grypari, I.; Lederman, R.; Naroditskiy, V.; and Tschantz, M. Botticelli: A Supply Chain Management Agent. In the 3rd International Joint Conference on Autonomous Agents and Multi-Agent Systems, July 2004 (pdf)
  • Benisch, M.; Greenwald, A.; Naroditskiy, V.; and Tschantz, M. A Stochastic Programming Approach to Scheduling in TAC SCM. In the 5th ACM Conference on Electronic Commerce, May 2004 (pdf)

Workshop papers

  • Greenwald, A.; Lee, S.; and Naroditskiy, V. Bidding Heuristics for Simultaneous Auctions: Lessons from TAC Travel. In Workshop on Trading Agent Design and Analysis at the 23rd Conference on Artificial Intelligence, June 2008 (pdf)
  • Zhou, Y. and Naroditskiy, V. An Algorithm for Stochastic Multiple-Choice Knapsack Problem and Application to Keywords Bidding. In Workshop on Targeting and Ranking for Online Advertising at the 17th International World Wide Web Conference, April 2008 (pdf).
  • Odean, T.; Naroditskiy, V.; Greenwald, A.; and Donaldson, J. Marginal Bidding: An Application of the Equimarginal Principle to Bidding in TAC SCM. In Workshop on Trading Agent Design and Analysis at the 22nd Conference on Artificial Intelligence, July 2007
  • Greenwald, A.; Guillemette B.; Naroditskiy V.; and Tschantz M. Scaling Up the Sample Average Approximation Method for Stochastic Optimization with Applications to Trading Agents. In Workshop on Trading Agent Design and Analysis at the 19th International Joint Conference on Artificial Intelligence, August 2005

Edited volume chapters

  • Greenwald, A.; Naroditskiy, V.; Odean, T.; Ramirez, M.; Sodomka, E.; Zimmerman, J.; and Cutler, C. Marginal Bidding: An Application of the Equimarginal Principle to Bidding in TAC SCM. In Edited volume on Agent-Mediated Electronic Commerce and Trading Agent Design and Analysis, Lecture Notes in Business Information Processing , Vol. 13, Collins, J.; Faratin, P.; Parsons, S.; Rodriguez-Aguilar, J.A.; Sadeh, N.M.; Shehory, O.; Sklar, E. (Eds.), Springer, 2009 (pdf)
  • Greenwald, A.; Guillemette B.; Naroditskiy V.; and Tschantz M. Scaling Up the Sample Average Approximation Method for Stochastic Optimization with Applications to Trading Agents. In Edited volume on Agent-Mediated Electronic Commerce. Designing Trading Agents and Mechanisms, Poutre, H. L.; Sadeh, N.; and Janson, S. (Eds.), Springer, 2006 (pdf)