3 research outputs found
Entry, competition and regulation in cognitive radio scenarios: a simple game theory model
[EN] Spectrum management based on private commons is argued to be a realistic scenario for cognitive radio deployment within the current mobile market structure. A scenario is proposed where a secondary entrant operator leases spectrum from a primary incumbent operator. The secondary operator innovates incorporating cognitive radio technology, and it competes in quality of service and price against the primary operator in order to provide service to users. We aim to assess which benefit users get from the entry of secondary operators in the market. A game theory-based model for analyzing both the competition between operators and the subscription decision by users is proposed. We conclude that an entrant operator adopting an innovative technology is better off entering the market, and that a regulatory authority should intervene first allowing the entrant operator to enter the market and then setting a maximum amount of spectrum leased. This regulatory intervention is justified in terms of users utility and social welfare.This work was supported by Spanish government through project TIN2010-21378-C02-02.Guijarro Coloma, LA.; Pla, V.; Vidal Catalá, JR.; Martínez Bauset, J. (2012). Entry, competition and regulation in cognitive radio scenarios: a simple game theory model. Mathematical Problems in Engineering. 1-13. https://doi.org/10.1155/2012/620972S11
A Competition-based Pricing Strategy in Cloud Markets using Regret Minimization Techniques
Cloud computing as a fairly new commercial paradigm, widely investigated by
different researchers, already has a great range of challenges. Pricing is a
major problem in Cloud computing marketplace; as providers are competing to
attract more customers without knowing the pricing policies of each other. To
overcome this lack of knowledge, we model their competition by an
incomplete-information game. Considering the issue, this work proposes a
pricing policy related to the regret minimization algorithm and applies it to
the considered incomplete-information game. Based on the competition based
marketplace of the Cloud, providers update the distribution of their strategies
using the experienced regret. The idea of iteratively applying the algorithm
for updating probabilities of strategies causes the regret get minimized
faster. The experimental results show much more increase in profits of the
providers in comparison with other pricing policies. Besides, the efficiency of
a variety of regret minimization techniques in a simulated marketplace of Cloud
are discussed which have not been observed in the studied literature. Moreover,
return on investment of providers in considered organizations is studied and
promising results appeared
Recommended from our members
Robust Methods for Influencing Strategic Behavior
Today's world contains many examples of engineered systems that are tightly coupled with their users and customers. In these settings, the strategic and economic behavior of users and customers can have a significant impact on the performance of the overall system, and it may be desirable for an engineer to devise appropriate methods of incentivizing human behavior to improve system performance. This work seeks to understand the fundamental tradeoffs involved in designing behavior-influencing mechanisms for complex interconnected sociotechnical systems. We study several examples and pose them as problems of game design: a planner chooses appropriate ways to select or modify the utility functions of individual agents in order to promote desired behavior. In social systems these modifications take the form of monetary or other incentives, whereas in multiagent engineered systems the modifications may be algorithmic. Here, we ask questions of sensitivity and robustness: for example, if the quality of information available to the planner changes, how can we quantify the impact of this change on the planner's ability to influence behavior? We propose a simple overarching framework for studying this, and then apply it to three distinct domains: incentives for network routing, distributed control design for multiagent engineered systems, and impersonation attacks in networked systems. We ask the following questions:- What features of a behavior-influencing mechanism directly confer robustness?We show weaknesses of several existing methodologies which use pricing for congestion control in transportation networks. In response to these issues, we propose a universal taxation mechanism which can incentivize optimal routing in transportation networks, requiring no information about network structure or user sensitivities, provided that it can charge sufficiently large prices. This suggests that large prices have more robustness than small ones. We also directly compare flow-varying tolls to fixed tolls, and show that a great deal of robustness can be gained by using a flow-varying approach.- How much information does a planner need to be confident that an incentive mechanism will not inadvertently induce pathological behavior?We show that for simple enough transportation networks (symmetric parallel networks are sufficient), a planner can provably avoid perverse incentives by applying a generalized marginal-cost taxation approach. On the other hand, we show that on general networks, perverse incentives are always a risk unless the incentive mechanism is given some information about network structure.- How can robust games be designed for multiagent coordination?We investigate a setting of multiagent coordination in which autonomous agents may suffer from unplanned communication loss events; the planner's task is to program agents with a policy (analogous to an incentive mechanism) for updating their utility functions in response to such events. We show that even when the nominal game is well-behaved and the communication loss is between weakly-coupled agents, there exists no utility update policy which can prevent arbitrarily-poor states from emerging. We also investigate a setting in which an adversary attempts to influence a distributed system in a robust way; here, by understanding susceptibility to adversarial influence, we hope to inform the design of more robust network systems