Building Knapsacks in TAC AA
Speaker
Abstract
| As you learned from Professor Greenwald's talk earlier this month, we model bidding in the Trading Agent Competition Ad Auctions (TAC AA) domain as a knapsack problem. This talk will focus on building knapsack problems from the information we receive and the models we create. We will begin by discussing the information we receive from the TAC AA simulation and the models we build using that information. Then, we will describe how we use these models to create a knapsack problem that is solved by the optimization routines discussed previously by Professor Greenwald. |
| Contact information: |
| Meditya Wasesa |
