multiagent.com
域名年龄: 26年4个月6天HTTP/1.1 200 OK 类型:text/html; charset=UTF-8 过期时间:2015年07月21日 02:59:47 访问时间:2015年07月21日 02:59:47 缓存控制:private, max-age=0 修改日期:2014年10月15日 05:44:50 网页标记:"ca8db9f5-d980-4212-85ec-22ec72ffa536" Content-Encoding: gzip X-Content-Type-Options: nosniff 网站XSS保护:1; mode=block 文件大小:18700 服务器:GSE Alternate-Protocol: 80:quic,p=0 网站编码:UTF-8
该域名无法解析为IP
Multiagent Systems and Agent-Based ModelingHome to the "Fundamentals of Multiagent Systems Using NetLogo" Textbook.Saturday, March 23, 2013Final ProjectFor 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 ProjectChoose a paper from the AAMAS proceedings (see also my AAMAS 2012 local copy, because their website is down a lot) 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).Another, very popular, 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 ProjectYour deliverable will be a paper that summarizes exisiting research on a specific topic, with appropriate citations, andeither 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.Posted byJose Vidalat9:33 AMLabels:homeworkWednesday, February 27, 2013Evolutionary DynamicsReplicator Dynamics are a math formula meant to simplify the dynamics of evolution. But, we can code, we don't have to simplify.In this video I show how to simulate simple evolutionary dynamics with more detail than before. The program, it turns out, is simpler than before.Posted byJose Vidalat6:00 AMLabels:lectureTuesday, February 26, 2013Replicator Dynamics ImplementationIn tomorrow's lecture I will be talking about replicator dynamics in games. The video below shows you how to implement it:Posted byJose Vidalat1:22 PMLabels:lectureSaturday, February 23, 2013Fictitious PlayNext week we will finish with cooperative games and start with 'learning in games'.Fictitious play is very easy and fun to implement in NetLogo. See how in this video:Posted byJose Vidalat7:21 AMLabels:lectureThursday, February 21, 2013Preferential Attachement Graphs and Stochastic ChoiceI noticed in the last homework that some of you had problems getting a preferential attachment graph to work, or making stochastic choice. The video below shows how to do this. This will also be useful for HW3.The code I wrote in that video is prefattachvideo.nlogo.Posted byJose Vidalat10:23 AMLabels:lectureWednesday, February 20, 2013HW3: Stability in Cooperative GamesWe have discussed cooperative games, the core, the nucleolus, and excess. For
© 2010 - 2020 网站综合信息查询 同IP网站查询 相关类似网站查询 网站备案查询网站地图 最新查询 最近更新 优秀网站 热门网站 全部网站 同IP查询 备案查询
2025-04-13 14:30, Process in 0.0051 second.