Loading...
Please wait, while we are loading the content...
Similar Documents
CMSC 858F: Algorithmic Game Theory Fall 2010 Multicast and Network Formation Games
| Content Provider | Semantic Scholar |
|---|---|
| Author | Bercea, Ioana Oriana |
| Copyright Year | 2010 |
| Abstract | We define the overarching goal of Network Formation Games to analyze the way (efficient) networks form under the existence of selfish agents, excluding a central authority. Generally, selfih behavior is defined as having two components: players want to minimize the expenses they incur for building the network and they also seek to obtain a high quality of service from the network. The strategy of each player is choosing a particular set of edges(generally path) according to such selfish behavior. Out interest is to study the social cot of such a network, particularly, to answer questions like ”‘Does the game have a Nash equilibrium?”’ and if it does, ”‘How much worse is it than the optimum?”’. The main tool used in answering such questions is the potential function method. Within this class of game, there are several variations. One refers to the costs incurred by the agents. There are ways of varying the cost of building an edge, depending on latency and congestion. Another important variation is the cost sharing mechanism that decides the way agent pay for their strategies and, in particular, for an edge. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://www.cs.umd.edu/~hajiagha/AGT10/B-1-scribe.pdf |
| Alternate Webpage(s) | http://www.cs.umd.edu/~hajiagha/AGT10/B-1-scribe.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
