Article

Resource pricing games on graphs: Existence of Nash equilibria

Optimization Letters (Impact Factor: 0.93). 02/2011; 7(2):1-10. DOI: 10.1007/s11590-011-0411-2

ABSTRACT

In this letter, we consider a non-cooperative resource pricing game on a graph where sellers (i.e., players) set the prices
for their own resources to maximize the payoffs and buyers migrate to seek the least expensive resources. We present a model
for the resource pricing game and prove the existence of Nash equilibria on regular and hierarchical graphs. The results obtained
are applicable to the study of market economies, social networks and computer networks where individuals trade resources in
a spatially extended environment.

KeywordsResource pricing–Peer-to-peer networks–Mobile agents–Market economies–Game theoretic modeling

1 Follower
 · 
8 Reads
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we develop a rational model of a market-oriented service overlay network in which peers trade resources and services through a common currency called energy. In our model, an overlay network is created by a set of non-cooperative resource providing peers, called platforms, that perform resource pricing and topology management to maximize their own energy gains. Resource consuming peers, called agents, are simply designed to migrate platform-to-platform to find least expensive resources in the network. Computer simulations are used to analyze global properties of the network that emerge from local interactions among a group of platforms and agents.
    No preview · Conference Paper · Sep 2010
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we formulate a non-cooperative optimization game in market-oriented overlay networks where participating peers share their own computing resources to earn virtual money called energy. We model an overlay network as a set of non-cooperative resource providing peers, called platforms, that perform resource pricing and topology management to maximize their own energy gains. Resource consuming peers, called agents, are simply designed to migrate platform-to-platform to find the least expensive resources in the network. Simulation results are presented to demonstrate the market dynamics as well as the global properties of the network, i.e., resource price and network topology, that emerge from local interactions among the group of peers.
    No preview · Article · Dec 2011 · Frontiers of Computer Science in China
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider a model whereby players compete for a set of shared resources to produce and sell substitute products in the same market, which can be viewed as a generalization of the classical Cournot oligopolistic competition model, or, from a different angle, the Wardrop type routing model. In particular, we suppose that there are K players, who compete for the usage of resources as well as the sales of the end-products. Moreover, the unit costs of the shared resources and the selling prices of the products are assumed to be affine linear functions in the consumption/production quantities. We show that the price of anarchy in this case is lower bounded by 1/K, and this bound is essentially tight, which manifests the harsh nature of the competitive market for the producers.
    No preview · Article · Aug 2013 · Journal of Global Optimization
Show more