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/

Zendy Plus

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

Zendy Tools

Zendy Open

We discuss the issue of distributed and cooperative decision-making in anetwork game of public service location. Each node of the network can choose tobe a provider of service which is accessible to the provider itself and also toall the neighboring nodes. A node may also choose only to be a consumer, andthen it has to pay a tax, and the collected tax is evenly distributed to allthe service providers to remedy their cost. If nodes do not communicate witheach other but make individual best-response decisions, the system will betrapped in an inefficient situation of high tax level. In this work weinvestigate a decentralized local-consensus selection mechanism, according towhich nodes in need of service recommend their neighbors of highest localimpact as candidate servers, and a node may become a server only if all itsnon-server neighbors give their assent. We demonstrate that thislocal-consensus mechanism, although only involving information exchange amongneighboring nodes, leads to socially efficient solutions with tax levelapproaching the lowest possible value. Our results may help in understandingand improving collective problem-solving in various networked social systemsand robotic systems.

Serving by local consensus in the public service location game