An Undergraduate Course in the Intersection of Computer Science and Economics

In recent years, major research advances have taken place in the intersection of computer science and economics, but this material has so far been taught primarily at the graduate level. This paper describes a novel semester-long undergraduate-level course in the intersection of computer science and economics at Duke University, titled "CPS 173: Computational Microeconomics.

[1]  Yoav Shoham,et al.  Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .

[2]  Manish Jain,et al.  Software Assistants for Randomized Patrol Planning for the LAX Airport Police and the Federal Air Marshal Service , 2010, Interfaces.

[3]  Tuomas Sandholm,et al.  The State of Solving Large Incomplete-Information Games, and Application to Poker , 2010, AI Mag..

[4]  S. Shapiro,et al.  Mathematics without Numbers , 1993 .

[5]  Robert J. Vanderbei,et al.  Linear Programming: Foundations and Extensions , 1998, Kluwer international series in operations research and management service.

[6]  Hal R. Varian,et al.  Designing the perfect auction , 2008, CACM.

[7]  H. Young.  Optimal Voting Rules , 1995 .

[8]  E. H. Clarke.  Multipart pricing of public goods , 1971 .

[9]  Vincent Conitzer,et al.  Complexity of Mechanism Design , 2002, UAI.

[10]  H. Young,et al.  A Consistent Extension of Condorcet’s Election Principle , 1978 .

[11]  Vincent Conitzer,et al.  Making decisions based on the preferences of multiple agents , 2010, CACM.

[12]  Moni Naor,et al.  Rank aggregation methods for the Web , 2001, WWW '01.

[13]  Theodore Groves,et al.  Incentives in Teams , 1973 .

[14]  Yoav Shoham,et al.  Computer science and game theory , 2008, CACM.

[15]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[16]  Vincent Conitzer,et al.  Improved Bounds for Computing Kemeny Rankings , 2006, AAAI.

[17]  Giuseppe Persiano,et al.  Special Issue on Algorithmic Game Theory , 2013, Theory of Computing Systems.

[18]  Jeannette M. Wing.  An introduction to computer science for non-majors using principles of computation , 2007, SIGCSE.

[19]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[20]  R. Vohra,et al.  Algorithmic Game Theory: Sponsored Search Auctions , 2007 .

[21]  Bo An,et al.  PROTECT: a deployed game theoretic system to protect the ports of the United States , 2012, AAMAS.

[22]  Yoav Shoham,et al.  Combinatorial Auctions , 2005, Encyclopedia of Wireless Networks.

[23]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[24]  Avrim Blum,et al.  Clearing algorithms for barter exchange markets: enabling nationwide kidney exchanges , 2007, EC '07.

[25]  Kidane Asrat Ghebreamlak.  Winner determination problem in combinatorial auctions , 2002 .

[26]  Craig Boutilier,et al.  Bidding Languages for Combinatorial Auctions , 2001, IJCAI.

[27]  David Levine,et al.  Winner determination in combinatorial auction generalizations , 2002, AAMAS '02.

[28]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[29]  Bo An,et al.  GUARDS and PROTECT: next generation applications of security games , 2011, SECO.

[30]  D. Lehmann,et al.  The Winner Determination Problem , 2003 .