The Price of Anarchy in Network Creation Games Is (Mostly) Constant

We study the price of anarchy and the structure of equilibria in network creation games. A network creation game is played by n players {1,2,…,n}, each identified with a vertex of a graph (network), where the strategy of player i, i=1,…,n, is to build some edges adjacent to i. The cost of building an edge is α>0, a fixed parameter of the game. The goal of every player is to minimize its creation cost plus its usage cost. The creation cost of player i is α times the number of built edges. In the SumGame variant, the usage cost of player i is the sum of distances from i to every node of the resulting graph. In the MaxGame variant, the usage cost is the eccentricity of i in the resulting graph of the game. In this paper we improve previously known bounds on the price of anarchy of the game (of both variants) for various ranges of α, and give new insights into the structure of equilibria for various values of α. The two main results of the paper show that for α>273?n all equilibria in SumGame are trees and thus the price of anarchy is constant, and that for α>129 all equilibria in MaxGame are trees and the price of anarchy is constant. For SumGame this answers (almost completely) one of the fundamental open problems in the field—is price of anarchy of the network creation game constant for all values of α?—in an affirmative way, up to a tiny range of α.     

Optimizing Safe Yield Policy Implementation

The presented method enhances groundwater-mandated safe yield management. It is useful for settings that prevent sustained yield or integrated management. To protect hydraulically connected surface water rights, the Utah government’s Cache Valley groundwater management plan proposes that total pumping increase not exceed 84,431 m³/day. To determine how best to spatially distribute additional allowable pumping, stakeholders quantified limits defining acceptable impacts on selected water resource indicators. A new simulation–optimization (S–O) algorithm used these limits while computing optimal spatially distributed perennial yield or safe yield groundwater pumping extraction strategies. The limits prevent unacceptable decreases in: head and net flow between aquifer and surface waters (rivers, surface/subsurface drains, springs, lakes). The optimization objective function maximizes weighted pumping to provide water for 18 growing municipalities. For 16 perennial yield scenarios, computed optimal pumping increases differ in protectiveness toward senior water rights, and range from 16% to 103% of the state plan-proposed increase. Implementing a protective strategy would achieve 90% of the storage changes needed to reach equilibrium within 23 years. Indicator potentiometric heads would reach equilibrium within 10–40 years. At equilibrium, an optimal Cache Valley perennial yield strategy acceptably minimizes net annual non-pumping discharges. By comparison, multi-period 20-year transient groundwater mining optimizations allow more pumping in early years. Pumping then must decline to satisfy seepage and head constraints through year 20. Adverse seepage impact would increase for years thereafter. For situations governed by safe or perennial yield policy, equilibrium-based (steady-state) optimization is very useful. It effectively develops optimal perennial yield strategies.     

Examining the dimensionality of genuine multipartite entanglement

Entanglement in high-dimensional many-body systems plays an increasingly vital role in the foundations and applications of quantum physics. In the present paper, we introduce a theoretical concept which allows to categorize multipartite states by the number of degrees of freedom being entangled. In this regard, we derive computable and experimentally friendly criteria for arbitrary multipartite qudit systems that enable to examine in how many degrees of freedom a mixed state is genuine multipartite entangled.     

Privacy-enhanced architecture for smart metering

The recent deployment of smart grids promises to bring numerous advantages in terms of energy consumption reduction in both homes and businesses. A more transparent and instantaneous measurement of electricity consumption through smart meters utilization leads to an enhancement in the ability of monitoring, controlling and predicting energy usage. Nevertheless, it also has associated drawbacks related to the privacy of customers, since such management might reveal their personal habits, which electrical appliances they are using at each moment, whether they are at home or not, etc. In this work, we present a privacy-enhanced architecture for smart metering aimed at tackling this threat by means of encrypting individual measurements while allowing the electricity supplier to access the aggregation of the corresponding decrypted values.     

确保管道运输的泄漏检测技术

保证所有管道中石油从一端流向另一端不泄漏要比它的探测更加困难。比较图中的3个系统,可以看到这项技术在40多年来是如何逐步发展的。     

Designing an information search interface for younger and older adults

OBJECTIVE: The present study examined Web-based information retrieval as a function of age for two information organization schemes: hierarchical organization and one organized around tags or keywords. BACKGROUND: Older adults' performance in information retrieval tasks has traditionally been lower compared with younger adults'. The current study examined the degree to which information organization moderated age-related performance differences on an information retrieval task. The theory of fluid and crystallized intelligence may provide insight into different kinds of information architectures that may reduce age-related differences in computer-based information retrieval performance. METHOD: Fifty younger (18-23 years of age) and 50 older (55-76 years of age) participants browsed a Web site for answers to specific questions. Half of the participants browsed the hierarchically organized system (taxonomy), which maintained a one-to-one relationship between menu link and page, whereas the other half browsed the tag-based interface, with a many-to-one relationship between menu and page. This difference was expected to interact with age-related differences in fluid and crystallized intelligence. RESULTS: Age-related differences in information retrieval performance persisted; however, a tag-based retrieval interface reduced age-related differences, as compared with a taxonomical interface. CONCLUSION: Cognitive aging theory can lead to interface interventions that reduce age-related differences in performance with technology. In an information retrieval paradigm, older adults may be able to leverage their increased crystallized intelligence to offset fluid intelligence declines in a computer-based information search task. APPLICATION: More research is necessary, but the results suggest that information retrieval interfaces organized around keywords may reduce age-related differences in performance.     

Mutual information for Lucas-Kanade Tracking (MILK): an inverse compositional formulation

Mutual Information (MI) is popular for registration via function optimisation. This work proposes an inverse compositional formulation of MI for Levenberg-Marquardt optimisation. This yields a constant Hessian, which may be pre-computed. Speed improvements of 15% were obtained, with convergence accuracies similar to those of the standard formulation.     

Multicamera people tracking with a probabilistic occupancy map

Given two to four synchronized video streams taken at eye level and from different angles, we show that we can effectively combine a generative model with dynamic programming to accurately follow up to six individuals across thousands of frames in spite of significant occlusions and lighting changes. In addition, we also derive metrically accurate trajectories for each one of them.Our contribution is twofold. First, we demonstrate that our generative model can effectively handle occlusions in each time frame independently, even when the only data available comes from the output of a simple background subtraction algorithm and when the number of individuals is unknown a priori. Second, we show that multi-person tracking can be reliably achieved by processing individual trajectories separately over long sequences, provided that a reasonable heuristic is used to rank these individuals and avoid confusing them with one another.