Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1707.07080

The Interplay of Competition and Cooperation Among Service Providers

Mohammad Hassan Lotfi·Xingran Chen·Saswati Sarkar
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the economics of the interaction between Mobile Virtual Network Operators (MVNOs) and Mobile Network Operators (MNOs). We investigate the incentives of an MNO for offering some of her resources to an MVNO instead of using the resources for her own End-Users (EUs). We consider a market with one MNO and one MVNO, and a continuum of undecided EUs. Two cases for EUs are considered: (i) when EUs need to choose either the MNO or the MVNO, and (ii) when EUs have an outside option. In each of these cases, we consider a non-cooperative framework of sequential game and a cooperative framework of bargaining game. We characterize the Subgame Perfect Nash Equilibria (SPNE) and Nash Bargaining Solution (NBS) of the sequential and bargaining games, respectively. We show that in the non-cooperative framework, SPNE assumes two forms: (i) the MNO invests minimally on her infrastructure and the MVNO leases all the newly invested resources and (ii) the MNO invests more on her infrastructure, the MVNO leases only part of these resources to the MVNO, and the MNO uses the rest herself to attract EUs. Thus, in both, the MNO generates revenue indirectly through the MVNO. In addition to that, in (ii), the MNO generates revenue directly from the EUs. We also prove that in the bargaining framework, the MVNO either reserves all the resources or no resources from the MNO, and the MNO's investments are guided by whether EUs have an outside option. If they don't, then the MNO invests as little as possible on her infrastructure. If they do, then the MNO invests more.

Explore related subjects

cs.GT

Keep this discovery

BibTeXRIS

Mohammad Hassan Lotfi, Xingran Chen, Saswati Sarkar. 2017-07-22. The Interplay of Competition and Cooperation Among Service Providers. https://arxiv.org/abs/1707.07080

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↗