Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1510.00781

Prospect Pricing in Cognitive Radio Networks

Yingxiang Yang·Leonard T. Park·Narayan B. Mandayam·Ivan Seskar·Arnold Glass·Neha Sinha
View original source ↗Read source document ↗Export metadata ↓

Abstract

Advances in cognitive radio networks have primarily focused on the design of spectrally agile radios and novel spectrum sharing techniques that are founded on Expected Utility Theory (EUT). In this paper, we consider the development of novel spectrum sharing algorithms in such networks taking into account human psychological behavior of the end-users, which often deviates from EUT. Specifically, we consider the impact of end-user decision making on pricing and management of radio resources in a cognitive radio enabled network when there is uncertainty in the Quality of Service (QoS) guarantees offered by the Service Provider (SP). Using Prospect Theory (a Nobel-Prize-winning behavioral economic theory that captures human decision making and its deviation from EUT), we design data pricing and channel allocation algorithms for use in cognitive radio networks by formulating a game theoretic analysis of the interplay between the price offerings, bandwidth allocation by the SP and the service choices made by end-users. We show that, when the end-users under-weight the service guarantee, they tend to reject the offer which results in under-utilization of radio resources and revenue loss. We propose prospect pricing, a pricing mechanism that can make the system robust to decision making and improve radio resource management. We present analytical results as well as preliminary human subject studies with video QoS.

Explore related subjects

cs.GTcs.ITmath.IT

Keep this discovery

BibTeXRIS

Yingxiang Yang, Leonard T. Park, Narayan B. Mandayam, Ivan Seskar, Arnold Glass, Neha Sinha. 2015-10-03. Prospect Pricing in Cognitive Radio Networks. https://doi.org/10.1109/tccn.2015.2488636

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↗