English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We analyze the network congestion game with atomic players, asymmetricstrategies, and the maximum latency among all players as social cost. Thisimportant social cost function is much less understood than the averagelatency. We show that the price of anarchy is at most two, when the network isa ring and the link latencies are linear. Our bound is tight. This is the firstsharp bound for the maximum latency objective.

The Price of Anarchy for Selfish Ring Routing is Two