Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1401.1479

Multilevel Pricing Schemes in a Deregulated Wireless Network Market

Andrey Garnaev·Yezekael Hayel·Eitan Altman
View original source ↗Read source document ↗Export metadata ↓

Abstract

Typically the cost of a product, a good or a service has many components. Those components come from different complex steps in the supply chain of the product from sourcing to distribution. This economic point of view also takes place in the determination of goods and services in wireless networks. Indeed, before transmitting customer data, a network operator has to lease some frequency range from a spectrum owner and also has to establish agreements with electricity suppliers. The goal of this paper is to compare two pricing schemes, namely a power-based and a flat rate, and give a possible explanation why flat rate pricing schemes are more common than power based pricing ones in a deregulated wireless market. We suggest a hierarchical game-theoretical model of a three level supply chain: the end users, the service provider and the spectrum owner. The end users intend to transmit data on a wireless network. The amount of traffic sent by the end users depends on the available frequency bandwidth as well as the price they have to pay for their transmission. A natural question arises for the service provider: how to design an efficient pricing scheme in order to maximize his profit. Moreover he has to take into account the lease charge he has to pay to the spectrum owner and how many frequency bandwidth to rent. The spectrum owner itself also looks for maximizing its profit and has to determine the lease price to the service provider. The equilibrium at each level of our supply chain model are established and several properties are investigated. In particular, in the case of a power-based pricing scheme, the service provider and the spectrum owner tend to share the gross provider profit. Whereas, considering the flat rate pricing scheme, if the end users are going to exploit the network intensively, then the tariffs of the suppliers (spectrum owner and service provider) explode.

Explore related subjects

cs.GT

Keep this discovery

BibTeXRIS

Andrey Garnaev, Yezekael Hayel, Eitan Altman. 2014-01-07. Multilevel Pricing Schemes in a Deregulated Wireless Network Market. https://arxiv.org/abs/1401.1479

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT↗
arXiv2026

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT↗
arXiv2026

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT↗