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

Sung Hyun Chun

dblp:125/9185 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2013
—ORCID · none

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

Computer networks · 1 · 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.

Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%
Computer networks
1 paper
Network optimization and economics · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › resource allocation
spectrum allocation
0.212013
Secondary Spectrum Trading - Auction-Based Framework for Spectrum Allocation and Profit Sharing · IEEE/ACM Trans. Netw. 2013
Algorithmic game theory and mechanism design › mechanism design
auction design
0.212013
Secondary Spectrum Trading - Auction-Based Framework for Spectrum Allocation and Profit Sharing · IEEE/ACM Trans. Netw. 2013
Algorithmic game theory and mechanism design › auction theory › auction mechanism
strategy-proof auction
0.212013
Secondary Spectrum Trading - Auction-Based Framework for Spectrum Allocation and Profit Sharing · IEEE/ACM Trans. Netw. 2013
Network optimization and economics › game theory › cooperative game theory
coalitional game
0.012013
Secondary Spectrum Trading - Auction-Based Framework for Spectrum Allocation and Profit Sharing · IEEE/ACM Trans. Netw. 2013

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

cooperative game theory · 0.3auction mechanism design · 0.3noncooperative game theory · 0.2non-cooperative game theory · 0.2
YearPublicationVenuePosition
2013 Secondary Spectrum Trading - Auction-Based Framework for Spectrum Allocation and Profit Sharing
abstract
Recently, dynamic spectrum sharing has been gaining interest as a potential solution to scarcity of available spectrum. We investigate the problem of designing a secondary spectrum-trading market when there are multiple sellers and multiple buyers and propose a general framework for the trading market based on an auction mechanism. To this end, we first introduce a new optimal auction mechanism, called the generalized Branco's mechanism (GBM). The GBM, which is both incentive-compatible and individually rational, is used to determine the assigned frequency bands and prices for them. Second, we assume that buyers of the spectrum are selfish and model their interaction as a noncooperative game. Using this model, we prove that when the sellers employ the GBM to vend their frequency bands, they can guarantee themselves the largest expected profits by selling their frequency bands jointly. Third, based on the previous finding, we model the interaction among the sellers as a cooperative game and demonstrate that, for any fixed strategies of the buyers, the core of the cooperative game is nonempty. This suggests that there exists a way for the sellers to share the profits from the joint sale of the spectrum so that no subset of sellers will find it beneficial to vend their frequency bands separately without the remaining sellers. Finally, we propose a profit-sharing scheme that can achieve any expected profit vector in the nonempty core of the cooperative game while satisfying two desirable properties.
Sung Hyun Chun, Richard J. La
IEEE/ACM Trans. Netw.1