scholarly journals Understanding the Power of Stigmergy of Anonymous Agents in Discrete Environments

2014 ◽  
Author(s):  
Gianlorenzo D'Angelo ◽  
Xavier Defago ◽  
Nicolas Nisse
Keyword(s):  
Anonymous Agents

scholarly journals TRUSTWORTHINESS AND TRUTH: THE EPISTEMIC PITFALLS OF INTERNET ACCOUNTABILITY

Episteme ◽  
2013 ◽  
Vol 11 (1) ◽  
pp. 63-81 ◽  
Author(s):  
Karen Frost-Arnold
Keyword(s):  
Social Psychology ◽  
Social Media ◽  
Behavioral Economics ◽  
Internet Communication ◽  
Anonymous Agents

AbstractSince anonymous agents can spread misinformation with impunity, many people advocate for greater accountability for internet speech. This paper provides a veritistic argument that accountability mechanisms can cause significant epistemic problems for internet encyclopedias and social media communities. I show that accountability mechanisms can undermine both the dissemination of true beliefs and the detection of error. Drawing on social psychology and behavioral economics, I suggest alternative mechanisms for increasing the trustworthiness of internet communication.

An Early Moment in the Discourse of “Terrorism:” Reflections on a Tale from Marco Polo

2006 ◽  
Vol 48 (2) ◽  
pp. 242-259 ◽  
Author(s):  
Bruce Lincoln
Keyword(s):  
Collective Narratives ◽  
Marco Polo ◽  
Specific Interests ◽  
Over Time ◽  
Anonymous Agents

My goal in this paper is to revisit a classic text that raises the most contemporary of issues: Marco Polo's stereotyped, highly influential, and highly prejudicial description of the “Old Man of the Mountain,” a text of virtually mythic status and power. Having invoked the category of “myth,” however, in a context where it is not commonly applied, it is useful to indicate how I use this term and why it seems appropriate. To begin, I would reject three widely accepted notions. First, myths are not sacred narratives. Although many myths claim sacred status, in this they misrecognize their own nature, for they are human stories, like any other. They simply make more exaggerated claims to a more elevated kind of authority. Second, myths are not collective narratives or the speech of any group as a whole. Rather, they are stories that are told and retold in countless variants. Often the authorship of these variants is unacknowledged, forgotten, or deliberately hidden, but in its details each variant advances the specific interests of those responsible for its production, revision, and circulation. These anonymous agents and absent authors misrepresent themselves—and those for whom they speak—as the group as a whole. Third, myths are neither false stories, nor true, but simply stories that claim to speak with authority about issues of deep importance. Sometimes these claims succeed and sometimes they fail, and the same story can change its status over time from myth to fable and back again, since such status is a function of reception.

scholarly journals On the Distributed Construction of Stable Networks in Polylogarithmic Parallel Time

Information ◽  
2021 ◽  
Vol 12 (6) ◽  
pp. 254
Author(s):  
Matthew Connor ◽  
Othon Michail ◽  
Paul Spirakis
Keyword(s):  
Polynomial Time ◽  
High Probability ◽  
Network Construction ◽  
Parallel Time ◽  
Finite State ◽  
Partial Characterisation ◽  
Regular Networks ◽  
State Assumption ◽  
Stable Network ◽  
Anonymous Agents

We study the class of networks, which can be created in polylogarithmic parallel time by network constructors: groups of anonymous agents that interact randomly under a uniform random scheduler with the ability to form connections between each other. Starting from an empty network, the goal is to construct a stable network that belongs to a given family. We prove that the class of trees where each node has any k≥2 children can be constructed in O(logn) parallel time with high probability. We show that constructing networks that are k-regular is Ω(n) time, but a minimal relaxation to (l,k)-regular networks, where l=k−1, can be constructed in polylogarithmic parallel time for any fixed k, where k>2. We further demonstrate that when the finite-state assumption is relaxed and k is allowed to grow with n, then k=loglogn acts as a threshold above which network construction is, again, polynomial time. We use this to provide a partial characterisation of the class of polylogarithmic time network constructors.

scholarly journals Autonomous division and integration of anonymous agents by using interaction between oscillators

2018 ◽  
Vol 84 (857) ◽  
pp. 17-00338-17-00338
Author(s):  
Shunya YAMASHITA ◽  
Daisuke KURABAYASHI ◽  
Yuya HATTORI
Keyword(s):  
Anonymous Agents

scholarly journals MONEY AND LIMITED ENFORCEMENT IN MULTILATERAL EXCHANGE

2018 ◽  
Vol 24 (5) ◽  
pp. 1222-1239
Author(s):  
Nicola Amendola ◽  
Leo Ferraris
Keyword(s):  
Essential Role ◽  
Fine Tuning ◽  
Clearing House ◽  
Limited Enforcement ◽  
Anonymous Agents

We propose a model in which money performs an essential role in the process of exchange, despite the presence of a multilateral clearing house that collects resources from and distributes them to anonymous agents. Money improves the functioning of the clearing house, simultaneously keeping the incentives to contribute and guaranteeing the fine-tuning of allocations.

Sign in / Sign up

Export Citation Format

Share Document