Results 51 to 60 of about 166,027,039 (183)
MathematicsThis article investigates the performance of the Weighted Shortest Processing Time (WSPT) rule as a local sequencing policy in a scheduling game for uniformly related parallel machines, where the social objective is the total weighted completion time ...
Felipe T. Muñoz, Rodrigo Linfati
doaj +1 more source
Strategic Access and Pricing in Internet of Things (IoT) Service With Energy Harvesting
IEEE Access, 2019 This paper studies an interaction between the Internet of Things (IoT) device and users, both of which act strategically to achieve their own objectives. In the IoT system under consideration, the users access the service provided by the IoT device, e.g.,
Zhongbin Wang +3 more
doaj +1 more source
Offload Decision Models and the Price of Anarchy in Mobile Cloud Application Ecosystems
IEEE Access, 2015 With the maturity of technologies, such as HTML5 and JavaScript, and with the increasing popularity of cross-platform frameworks, such as Apache Cordova, mobile cloud computing as a new design paradigm of mobile application developments is becoming ...
Bo Gao, Ligang He, Stephen A. Jarvis
doaj +1 more source
On the Constant Price of Anarchy Conjecture
CoRR, 2018 We study Nash equilibria and the price of anarchy in the classic model of Network Creation Games introduced by Fabrikant et al. In this model every agent (node) buys links at a prefixed price $α> 0$ in order to get connected to the network formed by all the $n$ agents.
Carme Àlvarez, Arnau Messegué
openaire +2 more sources
Price of anarchy in a Bertrand oligopoly market [PDF]
, 2006 Thesis (S.M.)--Massachusetts Institute of Technology, Computation for Design and Optimization Program, 2006.Includes bibliographical references (p. 107-110).The price of anarchy quantifies the inefficiency that occurs in the total system objective in the
Sun, Wei, S.M. Massachusetts Institute of Technology
core
The asymptotic price of anarchy for k-uniform congestion games [PDF]
, 2018 We consider the atomic version of congestion games with affine cost functions, and analyze the quality of worst case Nash equilibria when the strategy spaces of the players are the set of bases of a k-uniform matroid.
Uetz, Marc +8 more
core +2 more sources
Algorithms, 2009 We consider the problem of all-to-one selfish routing in the absence of a payment scheme in wireless sensor networks, where a natural model for cost is the power required to forward, referring to the resulting game as a Locally Minimum Cost Forwarding ...
Sarvesh Varatharajan +4 more
doaj +1 more source
The Price of Anarchy in Games of Incomplete Information [PDF]
ACM Transactions on Economics and Computation, 2012 We define smooth games of incomplete information. We prove an ’’extension theorem” for such games:price of anarchy bounds for pure Nash equilibria for all induced full-information games extendautomatically, without quantitative degradation, to all mixed-strategy Bayes-Nash equilibria withrespect to a product prior distribution over players’ preferences.
openaire +3 more sources
A Game-Theoretic Analysis of Multiple Protocol Data Flows in Hierarchical M2M Communication Networks
International Journal of Distributed Sensor Networks, 2013 A hierarchical machine-to-machine (M2M) communication network, where multiple heterogeneous devices compete for transmission on congested links, is considered.
Gang Wang, Jie Leng, Lin Bai
doaj +1 more source
Bargaining solutions in heterogeneous networks: A reinforcement learning‐based approach
IET Communications, 2021 To enhance the performance and the coverage area of the next‐generation heterogeneous wireless networks (HetNets), smaller cells such as femtocells are deployed. A reasonable resource allocation strategy is crucial for the operation of such systems.
Atena Ebrahimkhani, Bahareh Akhbari
doaj +1 more source