Wednesday, June 17, 2009
Tuesday, June 16, 2009
Opera Unite
The new opera unite implements a web server into every web browsers, thus allowing real peer-to-peer communications, that is, we can build multiagent systems that run solely on the browser without the need for a server to route all messages. I hope the big three (IE, firefox, chrome) also implement this.
Sunday, April 26, 2009
Algorithmic Game Theory Blog
Thursday, March 19, 2009
Fundamentals of Multiagent Systems: March 2009
I have updated the textbook. You will find the new version below. The changes are all bugfixes. I am extremely thankful to the many people, from across the world, who have taken time to email me about the errors they have found it the book. I am also very happy that so many are reading it. Unfortunately, since I have not had the chance to teach our multiagent systems class lately, I have not had the time to add new material to the textbook. Hopefully, I will be teaching the class again in the next couple of years and then I will add new material. Still, I do fill confident that the material in the textbook is mostly timeless (for example, the Nash bargaining solution goes back to 1950) so it should hold up fine as a good introduction to the field.
I would be amiss if I didn't mention that Shohan and Leyton-Brown published Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations which covers much of the same material my book is trying to cover. Still, their coverage is not identical. Their book also focuses more on proofs. My goal, on the other hand, is to develop a book for practitioners: people who want to engineer multiagent systems. Thus, I try to focus on algorithms and provide the hands-on NetLogo examples. Anyway, you be the judge.
Fundamentals of Multiagent SystemsWednesday, December 31, 2008
Fundamentals of Multiagent Systems
Below is my textbook on multiagent systems which I have been writing and using since 2004 or so. I constantly update it every time I teach the class again and as new algorithms appear. I use NetLogo examples to bring to life the various algorithms. You can visit my MAS netlogo page to see these and other example programs.
Sunday, December 7, 2008
Journal CFP: Social Choice
Computational social choice is a new interdisciplinary research area at the intersection of social choice theory and computer science that studies computational aspects of social choice mechanisms as well as applications of social choice ideas in the design and analysis of computing systems.
The aim of this special issue is to build on the spectacular success of two workshops in computational social choice (COMSOC'06, Amsterdam and COMSOC'08, Liverpool), and provide a forum for reseachers in the area to present their ideas on a variety of topics, including, but not limited to:
- Algorithmic aspects of voting rules
- Computational barriers to strategic behaviour
- Collective decision-making in multi-agent systems
- Preference elicitation and communication issues in voting
- Fair division
- Computational aspects of weighted voting games
- Collective decision-making in combinatorial domains
- Logic-based formalisms for social choice problems
- Belief and judgement aggregation
- Social software
We encourage submissions of high quality, original papers which are not simultaneously submitted for publication elsewhere. Papers should be formatted according to the journal style, and not exceed 20 pages including figures, references, etc. The papers must be submitted via the journal webpage: http://jaamas.edmgr.com/. When submitting your manuscript, please choose article type: 'SpIss:Social Choice; Elkind'.
IMPORTANT DATES:
- Manuscript submission deadline: February 15, 2009
- Notification due date: June 15, 2009
- Camera-ready manuscript due date: July 15, 2009
- Publication: December 2009
Edith Elkind (University of Southampton, United Kingdom), ee@ecs.soton.ac.uk
Jerome Lang (LAMSADE, Universite Paris-Dauphine, France), lang@irit.fr
A PDF version of this announcement is available at http://users.ecs.soton.ac.uk/ee/jaamas-flyer.pdf
