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

Hong-Xia Shen

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

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

Computer networks · 1

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
1 paper
Network optimization and economics · 100%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

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

TopicWeightPapersLastEvidence papers
Network optimization and economics › pricing
game-theoretic pricing
0.012002
Internet pricing with a game theoretical approach: concepts and examples · IEEE/ACM Trans. Netw. 2002
Network optimization and economics › pricing
internet pricing
0.012002
Internet pricing with a game theoretical approach: concepts and examples · IEEE/ACM Trans. Netw. 2002
Algorithmic game theory and mechanism design
cooperative game theory
0.012002
Internet pricing with a game theoretical approach: concepts and examples · IEEE/ACM Trans. Netw. 2002

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

nash equilibrium analysis · 0.1game theory · 0.1
YearPublicationVenuePosition
2002 Internet pricing with a game theoretical approach: concepts and examples
abstract
The basic concepts of three branches of game theory, leader-follower, cooperative, and two-person nonzero sum games, are reviewed and applied to the study of the Internet pricing issue. In particular, we emphasize that the cooperative game (also called the bargaining problem) provides an overall picture for the issue. With a simple model for Internet quality of service (QoS), we demonstrate that the leader-follower game may lead to a solution that is not Pareto optimal and in some cases may be "unfair," and that the cooperative game may provide a better solution for both the Internet service provider (ISP) and the user. The practical implication of the results is that government regulation or arbitration may be helpful. The QoS model is also applied to study the competition between two ISPs, and we find a Nash equilibrium point from which the two ISPs would not move out without cooperation. The proposed approaches can be applied to other Internet pricing problems such as the Paris Metro pricing scheme.
Xi-Ren Cao, Hong-Xia Shen, Rodolfo A. Milito, Patricia E. Wirth
IEEE/ACM Trans. Netw.2