• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 98
Next 10 →

A potential game approach for uplink resource allocation in a multichannel wireless access network

by Eitan Altman, Inria-sophia Antipolis, Anurag Kumar, Yezekael Hayel - in the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools , 2009
"... Abstract—We consider a resource allocation problem in a multichannel wireless access system being shared by several users for uplink transfer of elastic traffic. Each user can allocate its resources (e.g., radios, antennas or power) to one or more of the carriers. In this network scenario we conside ..."
Abstract - Cited by 5 (0 self) - Add to MetaCart
consider a problem of noncooperative allocation of resources by the users, with each user’s objective being to maximize its own utility. We apply the theory of potential games to solve this problem by transforming it into an equivalent global optimization one. We obtain structural properties

Channel Allocation in a Multiple Distributed Vehicular Users Using Game Theory 1

by Yusita Kasdani, Yong Huat Chew, Chau Yuen, Woon Hau Chin
"... Abstract — In this paper, we look into the channel allocation problem for a non-cooperative cognitive vehicular ad-hoc communication network with multiple communicating pairs distributed spatially apart. An algorithm which can search for all pure Nash Equilibrium (NE) solutions is presented. We stud ..."
Abstract - Add to MetaCart
becomes a useful tool to analyze networks of cognitive radios since it deals with resolving conflict arising from distributed but interactive decision making among selfish rational agents, where there exists risk and uncertainty [4-5]. In every game-theoretic approach, it is the Nash Equilibrium (NE

Transactions on Parallel and Distributed Systems

by Systems C. Special-purpose
"... (MMOGs) can include millions of concurrent players spread across the world and interacting with each other within a single session. Faced with high resource demand variability and with misfit resource renting policies, the current industry practice is to over-provision for each game tens of self-own ..."
Abstract - Add to MetaCart
(MMOGs) can include millions of concurrent players spread across the world and interacting with each other within a single session. Faced with high resource demand variability and with misfit resource renting policies, the current industry practice is to over-provision for each game tens of self

Game Theory Based Load Balanced Job AllocationCategories of load balancing policies

by Anthony T. Chronopoulos, A Noncooperative Scheme
"... Given a large number of jobs, find an allocation of jobs to computers optimizing a given objective function (e.g. total execution time or total cost). Anthony T. Chronopoulos • University of Texas at San Antonio Game Theory Based Load Balanced Job AllocationMotivation for a game theoretic approach C ..."
Abstract - Add to MetaCart
Given a large number of jobs, find an allocation of jobs to computers optimizing a given objective function (e.g. total execution time or total cost). Anthony T. Chronopoulos • University of Texas at San Antonio Game Theory Based Load Balanced Job AllocationMotivation for a game theoretic approach

Energy Efficient Non-Cooperative Methods for Resource Allocation in Cognitive Radio Networks

by Enrico Del Re, Renato Pucci, Luca Simone Ronga , 2011
"... In a cognitive radio network wherein primary and secondary users coexist, an efficient power allocation method repre-sents one of the most important key aspects. This paper provides a novel approach based on a game theory framework to solve this problem in a distributed and fair way. Formulated as a ..."
Abstract - Add to MetaCart
as an optimization problem, the resource allocation prob-lem between secondary users and primary users can be modeled and investigated with the Game Theory, and in par-ticular S-Modular Games, since they provide useful tools for the definition of multi objective distributed algorithms in the context of radio

Dynamic Effort Allocation Problem Using Genetic Algorithm Approach

by Prashant Johri, Udayan Ch
"... Abstract—Effort distribution plays a major role in software engineering field. Because the limited price projects are becoming common today, the process of effort estimation becomes crucial, to control the budget agreed upon. In last 10 years, numerous software reliability growth models (SRGM) have ..."
Abstract - Add to MetaCart
been developed but majority of model are under static assumption. The basic goal of this article is to explore an optimal resource allocation plan to minimize the software cost throughout the testing phase and operational phase under dynamic condition using genetic algorithm technique. This article

Efficient Management of Data Center Resources for Massively Multiplayer

by Online Games, Vlad Nae, Ru Iosup, Stefan Podlipnig, Radu Prodan, Dick Epema, Thomas Fahringer, Multiplayer Online Games
"... (MMOGs) can include millions of concurrent players spread across the world. To keep these highly-interactive virtual environments online, a MMOG operator may need to provision tens of thousands of computing resources from various data centers. Faced with large resource demand variability, and with m ..."
Abstract - Add to MetaCart
, and with misfit resource renting policies, the current industry practice is to maintain for each game tens of self-owned data centers. In this work we investigate the dynamic resource provisioning from external data centers for MMOG operation. We introduce a novel MMOG workload model that represents the dynamics

Modeling and analysis of air campaign resource allocation: a spatio-temporal decomposition approach

by Debasish Ghose, Mikhail Krichman, Jason L. Speyer, Jeff S. Shamma, Senior Member - IEEE Transaction of Systems, Man, and Cybernetics - Part A: Systems and Humans , 2002
"... Abstract—In this paper, we address the modeling and analysis issues associated with a generic theater level campaign where two adversaries pit their military resources against each other over a sequence of multiple engagements. In particular, we consider the scenario of an air raid campaign where on ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
. The temporal resource allocation problem is formulated and solved in a game-theoretical framework as a multiple resource interaction problem with linear attrition functions. The spatial resource allocation problem is posed as a risk minimization problem in which the optimal corridor of ingress and optimal

Incentive and service differentiation in P2P networks: A game theoretic approach

by Richard T. B. Ma, Sam C. M. Lee, John C. S. Lui, Senior Member, David K. Y. Yau - In IEEE/ACM Transactions on Networking
"... Abstract—Conventional peer-to-peer (P2P) networks do not provide service differentiation and incentive for users. Therefore, users can easily obtain information without themselves contributing any information or service to a P2P community. This leads to the well known free-riding problem. Consequent ..."
Abstract - Cited by 41 (11 self) - Add to MetaCart
in nature, has linear time complexity, and guarantees Pareto-optimal resource allocation. Second, we model the whole resource request/distribution process as a competition game between the competing nodes. We show that this game has a Nash equilibrium. To realize the game, we propose a protocol in which

Asymptotic optimality for distributed spectrum sharing using bargaining solutions

by Juan E. Suris, Luiz A. Dasilva, Zhu Han, Allen B. Mackenzie, Ramakant S. Komali - IEEE Trans. Wireless Commun , 2009
"... Abstract—Recent studies on spectrum usage reveal poor uti-lization, both spatially and temporally. Opportunistic use of licensed spectrum while limiting interference to primary users can enhance spectrum reuse and provide orders of magnitude improvement in available channel capacity. This calls for ..."
Abstract - Cited by 12 (2 self) - Add to MetaCart
of channels. Finally, we develop a distributed algorithm for spectrum sharing that is general enough to accomodate non-zero disagreement points, and show that it achieves allocations reasonably close to the Nash Bargaining Solution. Index Terms—Dynamic spectrum access, cooperation, game theory, radio resource
Next 10 →
Results 1 - 10 of 98
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University