Algoritmi per Sistemi Distribuiti Strategici. Two Research Traditions. Theoretical Computer Science: computational complexity What can be feasibly computed? Centralized or distributed computational models Game Theory: interaction between self-interested individuals
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.
Algoritmi per Sistemi Distribuiti Strategici
Both strategic and complexity matter!
Dominant Strategy Equilibrium is a strategy combination s*= (s1*, s2*, …, sN*), such that si* is a dominant strategy for each i, namely, for each s= (s1, s2, …, si , …, sN):
pi(s1, s2, …, si*, …, sN)≥ pi(s1, s2, …, si, …, sN)
pi(s*)≥ pi(s1*, s2*, …, si, …, sN*)