↓ Skip to main content

Algorithmic Game Theory

Overview of attention for book
Cover of 'Algorithmic Game Theory'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Logarithmic Query Complexity for Approximate Nash Computation in Large Games
  3. Altmetric Badge
    Chapter 2 Algorithmic Game Theory
  4. Altmetric Badge
    Chapter 3 The Parallel Complexity of Coloring Games
  5. Altmetric Badge
    Chapter 4 Complexity and Optimality of the Best Response Algorithm in Random Potential Games
  6. Altmetric Badge
    Chapter 5 Deciding Maxmin Reachability in Half-Blind Stochastic Games
  7. Altmetric Badge
    Chapter 6 The Big Match in Small Space
  8. Altmetric Badge
    Chapter 7 History-Independent Distributed Multi-agent Learning
  9. Altmetric Badge
    Chapter 8 On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games
  10. Altmetric Badge
    Chapter 9 Efficiency of Equilibria in Uniform Matroid Congestion Games
  11. Altmetric Badge
    Chapter 10 On the Price of Anarchy of Highly Congested Nonatomic Network Games
  12. Altmetric Badge
    Chapter 11 The Impact of Worst-Case Deviations in Non-Atomic Network Routing Games
  13. Altmetric Badge
    Chapter 12 On Selfish Creation of Robust Networks
  14. Altmetric Badge
    Chapter 13 Dynamic Resource Allocation Games
  15. Altmetric Badge
    Chapter 14 Analyzing Power in Weighted Voting Games with Super-Increasing Weights
  16. Altmetric Badge
    Chapter 15 Strong and Weak Acyclicity in Iterative Voting
  17. Altmetric Badge
    Chapter 16 Stable Matching with Uncertain Linear Preferences
  18. Altmetric Badge
    Chapter 17 The Stable Roommates Problem with Short Lists
  19. Altmetric Badge
    Chapter 18 The Price of Stability of Simple Symmetric Fractional Hedonic Games
  20. Altmetric Badge
    Chapter 19 Truthfulness and Approximation with Value-Maximizing Bidders
  21. Altmetric Badge
    Chapter 20 Envy-Free Revenue Approximation for Asymmetric Buyers with Budgets
  22. Altmetric Badge
    Chapter 21 SBBA: A Strongly-Budget-Balanced Double-Auction Mechanism
  23. Altmetric Badge
    Chapter 22 Revenue Maximization for Market Intermediation with Correlated Priors
  24. Altmetric Badge
    Chapter 23 Bribeproof Mechanisms for Two-Values Domains
  25. Altmetric Badge
    Chapter 24 The Anarchy of Scheduling Without Money
  26. Altmetric Badge
    Chapter 25 An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling
  27. Altmetric Badge
    Chapter 26 Designing Cost-Sharing Methods for Bayesian Games
Attention for Chapter 10: On the Price of Anarchy of Highly Congested Nonatomic Network Games
Altmetric Badge

About this Attention Score

  • Above-average Attention Score compared to outputs of the same age and source (53rd percentile)

Mentioned by

twitter
2 X users

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
7 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
On the Price of Anarchy of Highly Congested Nonatomic Network Games
Chapter number 10
Book title
Algorithmic Game Theory
Published in
arXiv, September 2016
DOI 10.1007/978-3-662-53354-3_10
Book ISBNs
978-3-66-253353-6, 978-3-66-253354-3
Authors

Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini, Colini-Baldeschi, Riccardo, Cominetti, Roberto, Scarsini, Marco

X Demographics

X Demographics

The data shown below were collected from the profiles of 2 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 7 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 7 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 43%
Researcher 1 14%
Unknown 3 43%
Readers by discipline Count As %
Engineering 3 43%
Unknown 4 57%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 12 May 2016.
All research outputs
#17,388,351
of 25,515,042 outputs
Outputs from arXiv
#358,324
of 924,684 outputs
Outputs of similar age
#213,730
of 328,677 outputs
Outputs of similar age from arXiv
#4,685
of 12,836 outputs
Altmetric has tracked 25,515,042 research outputs across all sources so far. This one is in the 21st percentile – i.e., 21% of other outputs scored the same or lower than it.
So far Altmetric has tracked 924,684 research outputs from this source. They receive a mean Attention Score of 4.3. This one has gotten more attention than average, scoring higher than 53% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 328,677 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 26th percentile – i.e., 26% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 12,836 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 53% of its contemporaries.