An O(log n / log log n}) Upper Bound on the Price of Stability for Undirected Shapley Network Design Games
نویسنده
چکیده
Article history: Received 27 January 2009 Received in revised form 14 March 2009 Accepted 22 April 2009 Available online xxxx Communicated by F.Y.L. Chin
منابع مشابه
Nash Equilibria with Minimum Potential in Undirected Broadcast Games
In this paper, we consider undirected network design games with fair cost allocation. We introduce two concepts Potential-Optimal Price of Anarchy (POPoA) and Potential-Optimal Price of Stability (POPoS), where POPoA is the ratio between the worst cost of Nash equilibria with optimal potential and the minimum social cost, and POPoS is the ratio between the best cost of Nash equilibria with opti...
متن کاملImproving the H k -Bound on the Price of Stability in Undirected Shapley Network Design Games
In this paper we show that the price of stability of Shapley network design games on undirected graphs with k players is at most k(k+1)/2−k 1+k3(k+1)/2−k2Hk = ( 1−Θ(1/k) ) Hk, where Hk denotes the k-th harmonic number. This improves on the known upper bound of Hk, which is also valid for directed graphs but for these, in contrast, is tight. Hence, we give the first non-trivial upper bound on th...
متن کاملTEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF COMPUTER SCIENCE A Network Creation Game with Nonuniform Interests
In a network creation game, initially proposed by Fabrikant et. al. [FLM+03], selfish players build a network by buying links to each other. Each player pays a fixed price per link α > 0, and suffers an additional cost that is the sum of distances to all other players. We study an extension of this game where each player is only interested in its distances to a certain subset of players, called...
متن کاملOn the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
In this paper we address the open problem of bounding the price of stability for network design with fair cost allocation for undirected graphs posed in [1]. We consider the case where there is an agent in every vertex. We show that the price of stability is O(log log n). We prove this by defining a particular improving dynamics in a related graph. This proof technique may have other applicatio...
متن کاملEfficient k-Shot Broadcasting in Radio Networks
The paper concerns time-efficient k-shot broadcasting in undirected radio networks. In a k-shot broadcasting algorithm, each node in the network is allowed to transmit at most k times. Both known and unknown topology models are considered. For the known topology model, the problem has been studied before by Ga̧sieniec et al. [14], who established an upper bound of D + O(kn1/(k−2) log n) and a lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 109 شماره
صفحات -
تاریخ انتشار 2009