Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hang Zhou 0004

dblp:26/3707-4 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2013
0000-0002-6879-1967ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
2 papers
Network optimization and economics · 54% Wireless networking · 41% Cellular and mobile networks · 5%
Theoretical computer science
1 paper
Mathematical optimization · 50% Algorithmic game theory and mechanism design · 50%

Topics — the 9 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking › cognitive radio › spectrum access
dynamic spectrum access
0.212013
Complexity of Allocation Problems in Spectrum Markets with Interference Complementarities · IEEE J. Sel. Areas Commun. 2013
Network optimization and economics
mechanism design
0.212013
Complexity of Allocation Problems in Spectrum Markets with Interference Complementarities · IEEE J. Sel. Areas Commun. 2013
Network optimization and economics › resource allocation
spectrum allocation
0.212013
Complexity of Allocation Problems in Spectrum Markets with Interference Complementarities · IEEE J. Sel. Areas Commun. 2013
Network optimization and economics
spectrum market
0.212013
Complexity of Allocation Problems in Spectrum Markets with Interference Complementarities · IEEE J. Sel. Areas Commun. 2013
Wireless networking › cognitive radio
spectrum sharing
0.212013
On the nature of revenue-sharing contracts to incentivize spectrum-sharing · INFOCOM 2013
Algorithmic game theory and mechanism design › resource allocation
allocation problems
0.212013
Complexity of Allocation Problems in Spectrum Markets with Interference Complementarities · IEEE J. Sel. Areas Commun. 2013
Mathematical optimization
combinatorial optimization
0.212013
Complexity of Allocation Problems in Spectrum Markets with Interference Complementarities · IEEE J. Sel. Areas Commun. 2013
Cellular and mobile networks
interference management
0.012013
Complexity of Allocation Problems in Spectrum Markets with Interference Complementarities · IEEE J. Sel. Areas Commun. 2013
Wireless networking › cognitive radio
spectrum access
0.012013
On the nature of revenue-sharing contracts to incentivize spectrum-sharing · INFOCOM 2013

Methods — techniques the papers use, named apart from their topics

game theory · 0.3complexity analysis · 0.3newsvendor model · 0.2
YearPublicationVenuePosition
2013 On the nature of revenue-sharing contracts to incentivize spectrum-sharing
abstract
In a limited form cellular providers have long shared spectrum in the form of roaming agreements. The primary motivation for this has been to extend the coverage of a wireless carrier's network into regions where it has no infrastructure. As devices and infrastructure become more agile, such sharing could be done on a much faster time-scale and have advantages even when two providers both have coverage in a given area, e.g., by enabling one provider to acquire “overflow” capacity from another provider during periods of high demand. This may provide carriers with an attractive means to better meet their rapidly increasing bandwidth demands. On the other hand, the presence of such a sharing agreement could encourage providers to underinvest in their networks, resulting in poorer performance. We adapt the newsvendor model from the operations management literature to model such a situation and to gain insight into these trade-offs. In particular, we analyze the structure of revenue-sharing contracts that incentivize both capacity sharing and increased access for end-users.
Randall Berry, Michael L. Honig, Thành Nguyen 0001, Vijay G. Subramanian, Hang Zhou 0004, Rakesh V. Vohra
INFOCOM5
2013 Complexity of Allocation Problems in Spectrum Markets with Interference Complementarities
abstract
Markets are often viewed as a key ingredient in facilitating more efficient dynamic spectrum access. In this paper we consider how such spectrum markets are influenced by a key property of the wireless medium: interference. Interference can result in "complementarities" among the "spectrum goods" being traded, which complicates the design of an efficient market mechanism. We consider several alternative models for defining such spectrum goods, and explore the impact of these choices on the complexity of the resulting market.
Hang Zhou 0004, Randall Berry, Michael L. Honig, Rakesh V. Vohra
IEEE J. Sel. Areas Commun.1
2011 Spectrum markets with interference complementarities
abstract
Extensive spectrum markets have the potential to enable more efficient use of this limited resource. Such markets must account for particular properties of the underlying wireless medium. In this paper we focus on one such aspect: the role of interference created among different agents who may purchase the right to use the same spectrum at nearby locations. Such interference can result in “complementarities” among the spectrum goods being traded, which complicates the design of an efficient market. We begin with a simple linear model for these complementarities that was shown to be computationally difficult in earlier work. We give several approximation algorithms for this model. We then consider several alternative models in which the spectrum goods are defined in different ways and explore the impact of these choices on the complexity of the resulting market.
Hang Zhou 0004, Randall Berry, Michael L. Honig, Rakesh V. Vohra
WiOpt1