Monday, November 21, 2011
Saturday, November 19, 2011
Readings: Anytime Algorithm for Optimal Coalitions
This Monday we will be discussing An anytime algorithm for optimal coalition structure generation by T Rahwan, SD Ramchurn, NR Jennings, and A Giovannucci.
Thursday, November 10, 2011
Readings for Next Week: Electric Vehicles and Robots
Next week we will be discussing Online Mechanism Design for Electric Vehicle Charging by Enrico H. Gerding, Valentin Robu, Sebastian Stein, David C. Parkes, Alex Rogers, Nicholas R. Jennings, as well as Who Goes There? Selecting a Robot to Reach a Goal Using Social Regret by Meytal Traub, Gal A. Kaminka, Noa Agmon.
Friday, November 4, 2011
Final Project
For the final project you have the option of a programming-oriented or a research-oriented final project. Whichever project you decide to do you must first meet with me to get it approved.
Programming Project
Choose a paper from the AAMAS proceedings and implement the algorithm they describe. In many cases you will need to make some simplifying assumptions. The papers discuss in class are especially good choices.
Or, you can also choose to implement any of the algorithms referenced in the our textbook that are not already implemented, or provide better visualizations of existing algorithms (for didactic purpose).
A final option is to build a NetLogo simulation of a multiagent problem in a separate domain, one which you are already familiar with, say, because you are doing a PhD thesis on that problem.
Research Project
Your deliverable will be a paper that summarizes exisiting research on a specific topic, with appropriate citations, and
either presents a new algorithm/protocol/etc. along the same lines or organizes these results in a novel way (think "survey paper").
The final paper should be at least 10 pages long. I will be looking to see that you understand the topic at hand and how the various contributions relate to each other. You will be looking at papers beyond the above conferences.
The final projects are due Wednesday May 1.
Programming Project
Choose a paper from the AAMAS proceedings and implement the algorithm they describe. In many cases you will need to make some simplifying assumptions. The papers discuss in class are especially good choices.
Or, you can also choose to implement any of the algorithms referenced in the our textbook that are not already implemented, or provide better visualizations of existing algorithms (for didactic purpose).
A final option is to build a NetLogo simulation of a multiagent problem in a separate domain, one which you are already familiar with, say, because you are doing a PhD thesis on that problem.
Research Project
Your deliverable will be a paper that summarizes exisiting research on a specific topic, with appropriate citations, and
either presents a new algorithm/protocol/etc. along the same lines or organizes these results in a novel way (think "survey paper").
The final paper should be at least 10 pages long. I will be looking to see that you understand the topic at hand and how the various contributions relate to each other. You will be looking at papers beyond the above conferences.
The final projects are due Wednesday May 1.
Next Week's Readings: Cooperation and Teamwork
Next week I will be presenting, and you should be reading, The Evolution of Cooperation in Self-Interested Agent Societies: A Critical Study by Hofmann, Chakraborty and Sycara, and Empirical Evaluation of Ad Hoc Teamwork in the Pursuit Domain by Barret, Stone, and Kraus. Both of these paper present models that would be perfect for implementing in NetLogo in your final project.
Subscribe to:
Posts (Atom)