Searcharxiv⌕ Search

arXiv · cs/0604078

The emergence of knowledge exchange: an agent-based model of a software market

Abstract

We investigate knowledge exchange among commercial organisations, the rationale behind it and its effects on the market. Knowledge exchange is known to be beneficial for industry, but in order to explain it, authors have used high level concepts like network effects, reputation and trust. We attempt to formalise a plausible and elegant explanation of how and why companies adopt information exchange and why it benefits the market as a whole when this happens. This explanation is based on a multi-agent model that simulates a market of software providers. Even though the model does not include any high-level concepts, information exchange naturally emerges during simulations as a successful profitable behaviour. The conclusions reached by this agent-based analysis are twofold: (1) A straightforward set of assumptions is enough to give rise to exchange in a software market. (2) Knowledge exchange is shown to increase the efficiency of the market.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Maria Chli, Philippe De Wilde. 2006-04-20. The emergence of knowledge exchange: an agent-based model of a software market. https://searcharxiv.com/abs/cs/0604078

Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.

KEEP EXPLORING

Related papers

Equilibrium decisions under partial observation: dynamical error bounds and information requirements

Reduced monitoring can preserve stable dynamics while changing an equilibrium decision. Motivated by heterogeneous urban-mobility indicator coverage, we study fixed linear observations of a nonlinear recovery flow coupled to a strategic fixed-point map, and ask when a decision based on the reduced model can be trusted. The main result is a joint certificate: bounds on trajectory tracking, equilibrium displacement and unresolved output dependence are assembled into one decision-margin error which, under a stated Gaussian observation model, yields a conservative one-sided test and an explicit information requirement for prescribed worst-case power. In the scalar experiment this requirement is sharp: when the effect does not exceed twice the error budget, no valid test has worst-case power above its size, however many observations are taken. A second result connects manifold-adapted observations to defect bounds through a locally invertible observation chart, while distinguishing observation initialisation from asymptotic phase initialisation. Supporting results, resting on established lumping, contraction and fixed-point theory, cover exact quotients, an observation-fibre obstruction and the dependence of recovery-time comparisons on the tolerance convention. Seven reproducible synthetic experiments examine each component. The results give conditional criteria for certifying partial monitoring and separate mathematical guarantees from empirical validation.

cs.MA↗

Even Loose Proximity Constraints Make Makespan-optimal Unlabeled Multi-agent Pathfinding Hard

We study $r$-Connected Unlabeled Multi-agent Pathfinding ($r$CUMAPF), a variant of MAPF where interchangeable agents have a proximity range $r\in \mathbb{N}$, and agents must form a single group in a given graph $G$ through limited-range communication at all times. The problem arises in fundamental applications such as self-reconfiguration and platooning, while standard MAPF does not capture proximity constraints. For the problem of finding a makespan-optimal solution, prior work shows NP-hardness for $r=1$ and polynomial-time solvability when $r$ is sufficiently large; the complexity for the intermediate case $2\le r$ is largely unknown. To narrow this gap, we show that finding a solution to $r$CUMAPF with makespan at most $2$ is NP-hard for $2\le r= O(|V|^{1-\varepsilon})$, where $0<\varepsilon\le 1$ is a fixed constant and $|V|$ is the number of vertices. As a consequence, we show that the labeled analogue of $r$CUMAPF is also NP-hard under the same condition.

cs.MA↗

Addressing Exogenous Variability in Cooperative Multi-Agent Reinforcement Learning

Cooperative multi-agent reinforcement learning (MARL) often fails under exogenous variability such as shifts in opponents or environment regimes that cannot be controlled by the team but alter the transition dynamics. We formalize this challenge as Exogenous Dec-POMDP (ED-POMDP), in which an episode-level exogenous regime, selected independently of the team, indexes the dynamics, and the global state is partitioned into components that are directly responsive to the current team action and components that are not directly action-responsive at the current step. This formulation exposes mediated influence: while team actions do not directly update the latter at the current step, they can shape their later evolution through induced changes in the former. Based on this, we propose LEICA, a CTDE-compatible algorithm that learns history-conditioned context representations for both components and shapes policy updates using agent-wise, influence-weighted counterfactual intrinsic rewards. Across SMAX benchmarks with opponent strategy shifts, LEICA consistently improves both training performance and generalization to unseen opponents' strategies over existing baselines, supporting the usefulness of influence-weighted shaping under exogenous train-test regime shifts.

cs.MA↗