Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 307

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Demand responsive pricing and competitive spectrum allocation via a spectrum server

Ileri, O., Samardzija, D., Sizer, T., Mandayam, N.B.·2005·First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005.

Abstract

In this paper we develop a framework for competition of future operators likely to operate in a mixed commons/property-rights regime under the regulation of a spectrum policy server (SPS). The operators dynamically compete for customers as well as portions of available spectrum. The operators are charged by the SPS for the amount of bandwidth they use in their services. Through demand responsive pricing, the operators try to come up with convincing service offers for the customers, while trying to maximize their profits. We first consider a single-user system as an illustrative example. We formulate the competition between the operators as a non-cooperative game and propose an SPS-based iterative bidding scheme that results in a Nash equilibrium of the game. Numerical results suggest that, competition increases the user's (customer's) acceptance probability of the offered service, while reducing the profits achieved by the operators. It is also observed that as the cost of unit bandwidth increases relative to the cost of unit infrastructure (fixed cost), the operator with superior technology (higher fixed cost) becomes more competitive. We then extend the framework to a multiuser setting where the operators are competing for a number of users at once. We propose an SPS-based bandwidth allocation scheme in which the SPS optimally allocates bandwidth portions for each user-operator session to maximize its overall expected revenue resulting from the operator payments. Comparison of the performance of this scheme to one in which the bandwidth is equally shared between the user-operator pairs reveals that such an SPS-based scheme improves the user acceptance probabilities and the bandwidth utilization in multiuser systems

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/dyspan.2005.1542635

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 3 references

Cited by

See all 307

Metadata

Authors
Ileri, O., Samardzija, D., Sizer, T., & Mandayam, N. B.
Venue
First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005.
Publisher
IEEE
Published
2005-12-10
Pages
194-202
OpenAlex
W2119109694
Cited by
307
References
3
FWCI
13.86
Type
conference paper
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Demand responsive pricing and competitive spectrum allocation via a spectrum server. https://app.cochat.ai/papers/10.1109/dyspan.2005.1542635
The paper
Ileri, O., Samardzija, D., Sizer, T., & Mandayam, N. B. (2005). Demand responsive pricing and competitive spectrum allocation via a spectrum server. First IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, 2005. DySPAN 2005. https://doi.org/10.1109/dyspan.2005.1542635

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.