Distributed Rational Decision Making. Author : Tuomas W. Sandholm Speakers : Praveen Guddeti (1---5) Tibor Moldovan (6---9) CSE 976, April 15, 2002. Outline. Introduction Evaluation criteria Non-cooperative interaction protocols Voting Auctions Bargaining
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
Author: Tuomas W. Sandholm
Speakers: Praveen Guddeti (1---5)
Tibor Moldovan (6---9)
CSE 976, April 15, 2002
1. Technology push.
2. Application pull.
35 % of agents have preferences cdba
33 % of agents have preferences acdb
32 % of agents have preferences bacd
1 a b c d
2 b c d a
3 c d a b
4 a b c d
5 b c d a
6 c d a b
7 a b c d
Borda count c wins with 20, b has 19, a has 18, d loses with 13
Borda count a wins with 15, b has 14,loses with 13
with d removed
ui: O R for each agent i [1,2].
2. Anonymity (symmetry).
3. Independence of irrelevant alternatives.
4. Pareto efficiency.
o* = arg maxo[u1(o)–u1(ofallback)][u2(o)–u2 (ofallback)]