We consider (prediction) markets where myopic agents sequentially interact with an automated market maker. We show a broad negative result: by varying the order of participation, ...
Minor containment is a fundamental problem in Algorithmic Graph Theory, as numerous graph algorithms use it as a subroutine. A model of a graph H in a graph G is a set of disjoint ...
Isolde Adler, Frederic Dorn, Fedor V. Fomin, Ignas...
Abstract-- The problem of private information "leakage" (inadvertently or by malicious design) from the myriad large centralized searchable data repositories drives the n...
Lalitha Sankar, S. Raj Rajagopalan, H. Vincent Poo...
Peridynamics (PD) is a continuum theory that employs a nonlocal model to describe material properties. In this context, nonlocal means that continuum points separated by a finite ...
Michael L. Parks, Richard B. Lehoucq, Steven J. Pl...
The lazy caching algorithm of Afek, Brown, and Merrit (1993) is a protocol that allows the use of local caches with delayed updates. It results in a memory model that is not atomi...