Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2305.19578

Economics of Spot Instance Service: A Two-stage Dynamic Game Apporach

Hyojung Lee·Lam Vu·Minsung Jang
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper presents the economic impacts of spot instance service on the cloud service providers (CSPs) and the customers when the CSPs offer it along with the on-demand instance service to the customers. We model the interaction between CSPs and customers as a non-cooperative two-stage dynamic game. Our equilibrium analysis reveals (i) the techno-economic interrelationship between the customers' heterogeneity, resource availability, and CSPs' pricing policy, and (ii) the impacts of the customers' service selection (spot vs. on-demand) and the CSPs' pricing decision on the CSPs' market share and revenue, as well as the customers' utility. The key technical challenges lie in, first, how we capture the strategic interactions between CSPs and customers, and second, how we consider the various practical aspects of cloud services, such as heterogeneity of customers' willingness to pay for the quality of service (QoS) and the fluctuating resource availability. The main contribution of this paper is to provide CSPs and customers with a better understanding of the economic impact caused by a certain price policy for the spot service when the equilibrium price, which from our two-stage dynamic game analysis, is able to set as the baseline price for their spot service.

Explore related subjects

cs.GTcs.DC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hyojung Lee, Lam Vu, Minsung Jang. 2023-05-31. Economics of Spot Instance Service: A Two-stage Dynamic Game Apporach. https://arxiv.org/abs/2305.19578

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↗