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

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

Spectrum sharing for unlicensed bands

Etkin, Raul, Parekh, Abhay, Tse, David·2007·IEEE Journal on Selected Areas in Communications

Abstract

We study a spectrum sharing problem in an unlicensed band where multiple systems coexist and interfere with each other. Due to asymmetries and selfish system behavior, unfair and inefficient situations may arise. We investigate whether efficiency and fairness can be obtained with self-enforcing spectrum sharing rules. These rules have the advantage of not requiring a central authority that verifies compliance to the protocol. Any self-enforcing protocol must correspond to an equilibrium of a game. We first analyze the possible outcomes of a one shot game, and observe that in many cases an inefficient solution results. However, systems often coexist for long periods and a repeated game is more appropriate to model their interaction. In this repeated game the possibility of building reputations and applying punishments allows for a larger set of self-enforcing outcomes. When this set includes the optimal operating point, efficient, fair, and incentive compatible spectrum sharing becomes possible. We present examples that illustrate that in many cases the performance loss due to selfish behavior is small. We also prove that our results are tight and quantify the best achievable performance in a non-cooperative scenario

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/jsac.2007.070402

Cites

1 of 1 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

Cited by

See all 859

Metadata

Authors
Etkin, R., Parekh, A., & Tse, D.
Venue
IEEE Journal on Selected Areas in Communications
Published
2007-04
Volume
25
Issue
3
Pages
517-528
ISSN
0733-8716 (ISSN-L)
OpenAlex
W2002937495
Cited by
859
References
1
FWCI
154.09
Type
journal article
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: Spectrum sharing for unlicensed bands. https://app.cochat.ai/papers/10.1109/jsac.2007.070402
The paper
Etkin, R., Parekh, A., & Tse, D. (2007). Spectrum sharing for unlicensed bands. IEEE Journal on Selected Areas in Communications. https://doi.org/10.1109/jsac.2007.070402

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.