The book titled Networks, Crowds, and Markets by David Easley and Jon Kleinberg is now available to download freely from the link above. The current version is a pre-publication draft.
As is evident from reading the outline, there is a lot of overlap between the research present in this book and multiagent research. They both deal with game theory, auctions, markets, bargaining and, most importantly, search in networks, albeit from different perspectives.
1 comment:
In graph theory, a flow network is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in Operations Research, a directed graph is called a network, the vertices are called nodes and the edges are called arcs. A flow must satisfy the restriction that the amount of flow into a node equals the amount of flow out of it, except when it is a source, which has more outgoing flow, or sink, which has more incoming flow. A network can be used to model traffic in a road system, fluids in pipes, currents in an electrical circuit, or anything similar in which something travels through a network of nodes.
Post a Comment