A Game Theoretic Model for the Formation of Navigable Small-World Networks

Kleinberg proposed a family of small-world networks to ex-plain the navigability of large-scale real-world social net-works. However, the underlying mechanism that drives real networks to be navigable is not yet well understood. In this paper, we present a game theoretic model for the for-mation of navigable small world networks. We model the network formation as a game in which people seek for both high reciprocity and long-distance relationships. We show that the navigable small-world network is a Nash Equilib-rium of the game. Moreover, we prove that the navigable small-world equilibrium tolerates collusions of any size and arbitrary deviations of a large random set of nodes, while non-navigable equilibria do not tolerate small group collu-sions or random perturbations. Our empirical evaluation further demonstrates that the system always converges to the navigable network even when limited or no information about other players ’ strategies is available. Our theoretical and empirical analyses provide important new insight on the connection between distance, reciprocity and navigability in social networks

Improving Reachability and Navigability in Recommender Systems

In this paper, we investigate recommender systems from a network perspective and investigate recommendation networks, where nodes are items (e.g., movies) and edges are constructed from top-N recommendations (e.g., related movies). In particular, we focus on evaluating the reachability and navigability of recommendation networks and investigate the following questions: (i) How well do recommendation networks support navigation and exploratory search? (ii) What is the influence of parameters, in particular different recommendation algorithms and the number of recommendations shown, on reachability and navigability? and (iii) How can reachability and navigability be improved in these networks? We tackle these questions by first evaluating the reachability of recommendation networks by investigating their structural properties. Second, we evaluate navigability by simulating three different models of information seeking scenarios. We find that with standard algorithms, recommender systems are not well suited to navigation and exploration and propose methods to modify recommendations to improve this. Our work extends from one-click-based evaluations of recommender systems towards multi-click analysis (i.e., sequences of dependent clicks) and presents a general, comprehensive approach to evaluating navigability of arbitrary recommendation networks

Integrating Green Infrastructure Into Stormwater Policy: Reliability, Watershed Management, and Environmental Psychology as Holistic Tools for Success

As cities continue to expand, the issues of flood control and urban water quality have become major modern sustainability challenges. Green infrastructure—the use of nature-based solutions to target, treat, and store stormwater at its source—has emerged as a possible solution. While green infrastructure does offer multiple benefits for urban users, its performance is also highly variable. This Article addresses a key gap in existing literature by explicitly addressing how uncertainty in environmental and anthropogenic factors affects green infrastructure performance and integration within the Clean Water Act’s municipal separate storm sewer (MS4) regulatory program

Navigable Networks as Nash Equilibria of Navigation Games

The common sense suggests that networks are not random mazes of purposeless connections, but that these connections are organised so that networks can perform their functions well. One function common to many networks is targeted transport or navigation. Using game theory, here we show that minimalistic networks designed to maximise the navigation efficiency at minimal cost share basic structural properties with real networks. These idealistic networks are Nash equilibria of a network construction game whose purpose is to find an optimal trade-off between the network cost and navigability. We show that these skeletons are present in the Internet, metabolic, English word, US airport, Hungarian road networks, and in a structural network of the human brain. The knowledge of these skeletons allows one to identify the minimal number of edges by altering which one can efficiently improve or paralyse navigation in the network

The emergence and spatial distribution of Chinese seaport cities

Seaports have historically played a key role in facilitating trade and growth. This paper is the first attempt in the literature to analyse the formation of Chinese seaport cities and the dynamics that drives it. First, we aim to identify theoretically the emergence of urbanized seaports with the help of a formal economic geography model. Second, employing an empirically plausible parameterisation of the model, we calibrate the evolutionary process and spatial distribution of seaports along the Chinese coastline.seaports; cities; economic growth; China

An algorithmic approach to social networks

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2005.Includes bibliographical references (p. 109-120).Social networks consist of a set of individuals and some form of social relationship that ties the individuals together. In this thesis, we use algorithmic techniques to study three aspects of social networks: (1) we analyze the "small-world" phenomenon by examining the geographic patterns of friendships in a large-scale social network, showing how this linkage pattern can itself explain the small-world results; (2) using existing patterns of friendship in a social network and a variety of graph-theoretic techniques, we show how to predict new relationships that will form in the network in the near future; and (3) we show how to infer social connections over which information flows in a network, by examining the times at which individuals in the network exhibit certain pieces of information, or interest in certain topics. Our approach is simultaneously theoretical and data-driven, and our results are based upon real experiments on real social-network data in addition to theoretical investigations of mathematical models of social networks.by David Liben-Nowell.Ph.D

The Impact of Speed Limits on Recreational Boating in the Lagoon of Venice

Speed limits were introduced in the Lagoon of Venice in 2002 to reduce wave motion, which damages environmentally sensitive areas in the broader Lagoon as well as buildings in the city of Venice. In this paper, we estimate the welfare losses experienced by recreational boaters as a result of the speed limits. We fit a single-site travel cost model to a sample of boaters intercepted as they depart from or arrive to marinas and launching ramps on the Lagoon. Our Poisson model is corrected for truncation and endogenous stratification. We construct three measures of the price per trip, which allow us to check the sensitivity of models and welfare estimates to possible measurement errors in the opportunity cost of time. Our results are robust to the measure of price used and conservatively peg the welfare losses of boaters to €7.7-9.6 million per year. Even under conservative assumptions, the welfare losses of boaters are sufficiently large that, given current monitoring and enforcement of the speed limits, we believe there is a strong incentive for boaters to disregard the limits.Travel cost method, Single-site model, Speed limits, Natural resources management