Rendezvous of Heterogeneous Mobile Agents in Edge-weighted Networks

We introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal times for the other agent. The goal of the agents is to meet on an edge or a node of the graph. In this scenario, we study the time required by the agents to meet, compared to the meeting time $T_{OPT}$ in the offline scenario in which the agents have complete knowledge about each others speed characteristics. When no additional assumptions are made, we show that rendezvous in our model can be achieved after time $O(n T_{OPT})$ in a $n$-node graph, and that such time is essentially in some cases the best possible. However, we prove that the rendezvous time can be reduced to $\Theta (T_{OPT})$ when the agents are allowed to exchange $\Theta(n)$ bits of information at the start of the rendezvous process. We then show that under some natural assumption about the traversal times of edges, the hardness of the heterogeneous rendezvous problem can be substantially decreased, both in terms of time required for rendezvous without communication, and the communication complexity of achieving rendezvous in time $\Theta (T_{OPT})$

Simulating complex social behaviour with the genetic action tree kernel

The concept of genetic action trees combines action trees with genetic algorithms. In this paper, we create a multi-agent simulation on the base of this concept and provide the interested reader with a software package to apply genetic action trees in a multi-agent simulation to simulate complex social behaviour. An example model is introduced to conduct a feasibility study with the described method. We find that our library can be used to simulate the behaviour of agents in a complex setting and observe a convergence to a global optimum in spite of the absence of stable states

Activation of the Fas/Fas ligand pathway in hypertensive renal disease in Dahl/Rapp rats

BACKGROUND: Hypertensive nephrosclerosis is the second most common cause of end-stage renal failure in the United States. The mechanism by which hypertension produces renal failure is incompletely understood. Recent evidence demonstrated that an unscheduled and inappropriate increase in apoptosis occurred in the Dahl/Rapp rat, an inbred strain of rat that uniformly develops hypertension and hypertensive nephrosclerosis; early correction of the hypertension prevents the renal injury. The present study examined the role of the Fas/FasL pathway in this process. METHODS: Young male Dahl/Rapp salt-sensitive (S) and Sprague-Dawley rats were fed diets that contained 0.3% or 8.0% NaCl diets. Kidneys were examined at days 7 and 21 of the study. RESULTS: An increase in Fas and FasL expression was observed in glomerular and tubular compartments of kidneys of hypertensive S rats, whereas dietary salt did not change expression of either of these molecules in normotensive Sprague-Dawley rats. Associated with this increase was cleavage of Bid and activation of caspase-8, the initiator caspase in this apoptotic pathway, by day 21 of the study. CONCLUSIONS: Augmented expression of apoptotic signaling by the Fas/FasL pathway occurred during development of end-stage renal failure in this model of hypertensive nephrosclerosis

Almost optimal asynchronous rendezvous in infinite multidimensional grids

Two anonymous mobile agents (robots) moving in an asynchronous manner have to meet in an infinite grid of dimension δ> 0, starting from two arbitrary positions at distance at most d. Since the problem is clearly infeasible in such general setting, we assume that the grid is embedded in a δ-dimensional Euclidean space and that each agent knows the Cartesian coordinates of its own initial position (but not the one of the other agent). We design an algorithm permitting the agents to meet after traversing a trajectory of length O(d δ polylog d). This bound for the case of 2d-grids subsumes the main result of [12]. The algorithm is almost optimal, since the Ω(d δ) lower bound is straightforward. Further, we apply our rendezvous method to the following network design problem. The ports of the δ-dimensional grid have to be set such that two anonymous agents starting at distance at most d from each other will always meet, moving in an asynchronous manner, after traversing a O(d δ polylog d) length trajectory. We can also apply our method to a version of the geometric rendezvous problem. Two anonymous agents move asynchronously in the δ-dimensional Euclidean space. The agents have the radii of visibility of r1 and r2, respectively. Each agent knows only its own initial position and its own radius of visibility. The agents meet when one agent is visible to the other one. We propose an algorithm designing the trajectory of each agent, so that they always meet after traveling a total distance of O( ( d)), where r = min(r1, r2) and for r ≥ 1. r)δpolylog ( d r

Third-Party Strategy under Plurality Rule: The British Liberal Democrats and the New Zealand Social Credit Party

This paper examines the strategic options facing small centrist third parties in two-party parliamentary systems operating under the single-member district plurality (SMDP) electoral system. It uses a spatial model to show that centrist third parties are better off targeting the 'safe' districts of a major party rather than marginal districts. Furthermore, it is optimal to target one party's districts, not both, to benefit from tactical and protest voting. The paper also questions the implicit conclusion of the median-legislator theorem that pivotality-seeking is the best strategy for a third party, at least under SMDP, because that would usurp voters' ability to select the executive directly, a key feature of two-partism. Finally, the paper shows that third parties can damage themselves if they 'flip' from opposition to one major party to support for it. Evidence is provided for the British Liberal Democrats and New Zealand?s historic Social Credit Party

The Rationality of Prejudices

We model an -player repeated prisoner's dilemma in which players are given traits (e.g., height, age, wealth) which, we assume, affect their behavior. The relationship between traits and behavior is unknown to other players. We then analyze the performance of “prejudiced” strategies—strategies that draw inferences based on the observation of some or all of these traits, and extrapolate the inferred behavior to other carriers of these traits. Such prejudiced strategies have the advantage of learning rapidly, and hence of being well adapted to rapidly changing conditions that might result, for example, from high migration or birth rates. We find that they perform remarkably well, and even systematically outperform both Tit-For-Tat and ALLD when the population changes rapidly

The roots of romantic cognitivism:(post) Kantian intellectual intuition and the unity of creation and discovery

During the romantic period, various authors expressed the belief that through creativity, we can directly access truth. To modern ears, this claim sounds strange. In this paper, I attempt to render the position comprehensible, and to show how it came to seem plausible to the romantics. I begin by offering examples of this position as found in the work of the British romantics. Each thinks that the deepest knowledge can only be gained by an act of creativity. I suggest the belief should be seen in the context of the post-Kantian embrace of “intellectual intuition.” Unresolved tensions in Kant's philosophy had encouraged a belief that creation and discovery were not distinct categories. The post-Kantians held that in certain cases of knowledge (for Fichte, knowledge of self and world; for Schelling, knowledge of the Absolute) the distinction between discovering a truth and creating that truth dissolves. In this context, the cognitive role assigned to acts of creativity is not without its own appeal