International Workshop on Challenges and Visions in the Social Sciences

Adressing the validation problem for social simulations

author: Gabriel Istrate, eAustria Research Institute
published: Sept. 26, 2008, recorded: August 2008, views: 114

You might be experiencing some problems with Your Video player.

Slides

Slides
0:00	Addressing the validation problem for social simulations: the Adversarial Scheduling Approach
0:19	Two sides of the same coin part1
1:01	Two sides of the same coin part2
1:03	Two sides of the same coin part3
1:05	Two sides of the same coin part4
1:26	Interpreting results part1
1:49	Interpreting results part2
2:11	Interpreting results part3
2:19	Interpreting results part4
2:49	Verification & Validation part1
3:15	Verification & Validation part2
4:18	Verification & Validation part3
4:36	Verification & Validation part4
4:39	Verification & Validation part5
4:57	Verification & Validation part6
5:01	Context: Mechanism-based explanations part1
5:33	Context: Mechanism-based explanations part2
6:45	Context: Mechanism-based explanations part3
7:27	Context: Mechanism-based explanations part4
7:29	Context: Mechanism-based explanations part5
8:01	Adversarial Scheduling part1
8:44	Adversarial Scheduling part2
8:46	Adversarial Scheduling part3
9:35	Adversarial Scheduling part4
9:40	Adversarial Scheduling part5
9:50	Adversarial Scheduling part6
9:57	Base model part1
10:24	Base model part2
10:42	Base model part3
11:27	Base model part4
11:59	Base model part5
12:22	Base model part6
12:29	Base model part7
13:33	Second version part1
13:50	Second version part2
13:51	Second version part3
14:07	Second version part4
14:17	Second version part5
15:17	Second version part6
15:19	Third version: adding interaction part1
15:32	Third version: adding interaction part2
15:49	Peyton-Young’s result part1
16:00	Peyton-Young’s result part2
16:03	Peyton-Young’s result part3
16:27	Peyton-Young’s result part4
17:03	Peyton-Young under adversarial scheduling part1
17:17	Peyton-Young under adversarial scheduling part2
17:27	Peyton-Young under adversarial scheduling part3
17:55	Peyton-Young under adversarial scheduling part4
18:09	Peyton-Young under adversarial scheduling part5
18:10	Peyton-Young under adversarial scheduling part6
18:19	Proff idea
18:37	Proof idea (II) part1
18:40	Proof idea (II) part2
18:45	Proof idea (II) part3
18:46	Proof idea (II) part4
18:56	Proff idea
19:16	Proof idea (II) part1
19:24	Proof idea (II) part2
19:25	Proof idea (II) part3
19:28	Proof idea (II) part4
19:38	Proof idea (III) part1
19:40	Proof idea (III) part2
19:44	Proof idea (III) part3
19:45	Proof idea (III) part4
19:55	Application: Schelling’s Segregation Model part1
20:09	Application: Schelling’s Segregation Model part2
20:17	Application: Schelling’s Segregation Model (II) part1
20:18	Application: Schelling’s Segregation Model (II) part2
20:37	Back to Potential Games and Peyton-Young part1
20:39	Back to Potential Games and Peyton-Young part2
20:40	Back to Potential Games and Peyton-Young part3
20:42	Back to Potential Games and Peyton-Young part4
20:44	Extension: work in progress part1
21:10	Extension: work in progress part2
21:12	Extension: work in progress part3
21:28	Extension: work in progress part4
21:29	Extension: work in progress part5
21:47	Can this be done in Social Simulations ? part1
21:47	Can this be done in Social Simulations ? part2
21:48	Can this be done in Social Simulations ? part3
21:49	Can this be done in Social Simulations ? part4
21:51	Can this be done in Social Simulations ? part5
21:52	Can this be done in Social Simulations ? part6

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.

Lecture popularity: You need to login to cast your vote.