By Topic

Game Theory for Networks, 2009. GameNets '09. International Conference on

Date 13-15 May 2009

Filter Results

Displaying Results 1 - 25 of 101
  • [Front cover]

    Publication Year: 2009, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (5947 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2009, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (89 KB)
    Freely Available from IEEE
  • Program at a glance

    Publication Year: 2009, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (3585 KB)
    Freely Available from IEEE
  • Committees

    Publication Year: 2009, Page(s):vi - viii
    Request permission for commercial reuse | PDF file iconPDF (145 KB)
    Freely Available from IEEE
  • A message from the Technical Program Committee Co-Chairs

    Publication Year: 2009, Page(s): v
    Request permission for commercial reuse | PDF file iconPDF (71 KB)
    Freely Available from IEEE
  • A message from the General Chair: Tamer Başar

    Publication Year: 2009, Page(s):i - iii
    Request permission for commercial reuse | PDF file iconPDF (710 KB)
    Freely Available from IEEE
  • Organizers and sponsors

    Publication Year: 2009, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (2087 KB)
    Freely Available from IEEE
  • Rational expectations in games

    Publication Year: 2009, Page(s):xi - xii
    Cited by:  Papers (2)
    Request permission for commercial reuse | PDF file iconPDF (464 KB)
    Freely Available from IEEE
  • The majority game on regular and random networks

    Publication Year: 2009, Page(s):xii - xiii
    Request permission for commercial reuse | PDF file iconPDF (410 KB)
    Freely Available from IEEE
  • Strategic network formation

    Publication Year: 2009, Page(s): xiv
    Request permission for commercial reuse | PDF file iconPDF (179 KB)
    Freely Available from IEEE
  • [Paper titles and abstracts]

    Publication Year: 2009, Page(s):1 - 39
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (10921 KB)

    Provides an abstract for each of the presentations in the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Cooperative game theoretic approach to integrated bandwidth sharing and allocation

    Publication Year: 2009, Page(s):1 - 9
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2703 KB) | HTML iconHTML

    The current trend in wireless communication networks involves the integration of different wireless access technologies into a single operator network. The possible leveraging of high deployment costs, and the possibility to increase revenue have also introduced the concept of network sharing between different operators. The problem of optimal allocation of bandwidth to multimedia applications ove... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coalition formation through learning in autonomic networks

    Publication Year: 2009, Page(s):10 - 16
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (351 KB) | HTML iconHTML

    Autonomic networks rely on the cooperation of participating nodes for almost all their functions. However, due to resource constraints, nodes are generally selfish and try to maximize their own benefit when participating in the network. Therefore, it is important to study mechanisms, which can be used as incentives for cooperation inside the network. In this paper, the interactions among nodes are... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Minimum cut tree games

    Publication Year: 2009, Page(s):17 - 25
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    In this paper we introduce a cooperative game based on the minimum cut tree problem which is also known as multi-terminal maximum flow problem. In a routing situation a network with capacities induced by vertices of a coalition has to be substituted by a network providing the same capacity for non-simultaneous flows but having a minimum number of edges and minimum total capacity. The solutions to ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Decentralized decision making process for document server networks

    Publication Year: 2009, Page(s):26 - 32
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1478 KB) | HTML iconHTML

    A peer-to-peer server network system consists of a large number of autonomous servers logically connected in a peer-to-peer way where each server maintains a collection of documents. When a query of storing new documents is received by the system, a distributed search process determines the most relevant servers and redirects the documents to them for processing (compressing and storing at the rig... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A noncooperative approach to joint rate and power control for infrastructure wireless networks

    Publication Year: 2009, Page(s):33 - 42
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (827 KB) | HTML iconHTML

    This paper shows how to tailor a game-theoretic approach to the issue of distributed resource allocation in a multiple-access wireless network with different quality of service constraints. According to the nature of the terminals (either fixed/vehicular or mobile/battery-powered, in one respect, and either licensed or unlicensed in another), each user pursues a different goal in the network. Game... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Uplink power control and base station association in multichannel cellular networks

    Publication Year: 2009, Page(s):43 - 51
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (430 KB) | HTML iconHTML

    A combined base station association and power control problem is studied for the uplink of multichannel multicell cellular networks, in which each channel is used by exactly one cell (i.e., base station). A distributed association and power update algorithm is proposed and shown to converge to a Nash equilibrium of a noncooperative game. We consider network models with discrete mobiles (yielding a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Power games in MIMO interference systems

    Publication Year: 2009, Page(s):52 - 59
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (415 KB) | HTML iconHTML

    We consider a multi-link and multi-input-multi-output (MIMO) interference system in which each link wishes to minimize its own power by choosing its own signal vector subject to an information theoretic quality-of-service (QoS) requirement. Our setup leads to a multi-link game, referred to as a ldquopower gamerdquo, in which the feasible strategy set of an individual link depends on the strategies... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed power control using non-monotonic reaction curves

    Publication Year: 2009, Page(s):60 - 67
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (457 KB) | HTML iconHTML

    In this paper, we study distributed power control in an interference network. In particular, distributed power control mechanisms are devised by exploiting a one-shot non-cooperative game based on a suitably chosen utility function. The utility is a function of quality of service (QoS) objectives defined in terms of fading-induced outage probabilities. Equilibrium analysis of the resulting power c... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Oblivious equilibrium: An approximation to large population dynamic games with concave utility

    Publication Year: 2009, Page(s):68 - 69
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    We study stochastic games with a large number of players, where players are coupled via their payoff functions. A standard solution concept for such games is Markov perfect equilibrium (MPE). It is well known that the computation of MPE suffers from the ldquocurse of dimensionality.rdquo Recently an approximate solution concept called ldquooblivious equilibriumrdquo (OE) was developed by Weintraub... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A hierarchical spatial game over licenced resources

    Publication Year: 2009, Page(s):70 - 79
    Cited by:  Papers (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (409 KB) | HTML iconHTML

    We consider a scenario in which a regulator owns the spectrum in a region. Two service providers lease spectrum from the regulator and set up a base station each to serve mobile subscribers. This leads to a hierarchical game with players at two levels- the mobile subscribers at level 1 and the service providers at level 2. In the game at level 1, each mobile subscriber chooses a service provider t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Asynchronous gossip algorithms for stochastic optimization

    Publication Year: 2009, Page(s):80 - 81
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (341 KB) | HTML iconHTML

    We consider a distributed multi-agent network system where the goal is to minimize an objective function that can be written as the sum of component functions, each of which is known (with stochastic errors) to a specific network agent. We propose an asynchronous algorithm that is motivated by a random gossip scheme where each agent has a local Poisson clock. At each tick of its local clock, the a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reliable relaying with uncertain knowledge

    Publication Year: 2009, Page(s):82 - 87
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (333 KB) | HTML iconHTML

    The motivation for this paper is to analyze the effect of information uncertainty on the design and performance of protocols. The paper considers two types of situations. The first is when different nodes in the network have bounded knowledge about what other nodes know. The second, called common knowledge about inconsistent beliefs, is when the information is inconsistent but everyone knows it. S... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • N-player cournot and price-quantity function mixed competition

    Publication Year: 2009, Page(s):88 - 97
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (437 KB) | HTML iconHTML

    We study the value of network providers committing to offering a quantity of bandwidth to a market versus having the amount of bandwidth offered be conditional on the prices that the market settles upon. For instance a cable television ISP has the option to shift capacity from Internet service to television channels if the market price for Internet service is low, and thus such a provider can avoi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Traffic engineering, content distribution, and continuous potential games

    Publication Year: 2009, Page(s):98 - 99
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (300 KB) | HTML iconHTML

    We explore the interaction between content distribution and traffic engineering. Because a traffic engineer may be unaware of the structure of content distribution systems or overlay networks, his management of the network does not fully anticipate how traffic might change as a result of his actions. Content distribution systems that assign servers at the application level can respond very rapidly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.