In a symmetric independent private values setting a sealed-bid double auction dissolves a partnership e¢ciently. This well known result remains valid in a model with interdependent valuations. However, if the interdependent components of valuations are large agents might prefer not to participate in a double auction. Therefore a simple extention of the rules of double-auctions is suggested that...

constraint bipartite vertex cover is a graph-theoretical formalization of the spare allocation problem for reconfigurable arrays. We report on an implementation of a parameterized algorithm for this problem. This has led to considerable simplifications of the published, quite sophisticated algorithm. Moreover, we can prove that the mentioned algorithm could be quite efficient in practial situat...

The number of studies seeking to empirically characterize the reduced-form relationship between a country economic growth and the quantity of various pollutants produced has recently increased significantly. In several cases researchers have found evidence in favor of an inverted-U “environmental Kuznets” curve. In the case of a major greenhouse gas, CO2, however, the evidence is at best mixed....

Understanding the cloud response to sea ice change is necessary for modeling Arctic climate. Previous work has primarily addressed this problem from the interannual variability perspective. This paper provides a refined perspective of sea ice-cloud relationship in the Arctic using a satellite footprint-level quantification of the covariance between sea ice and Arctic low cloud properties from N...

A Minimal Cover by Triples is an ordered pair (V, T ) where V is a finite set and T is a collection of three-element subsets of V with the properties that every pair of elements of V appear together in at least one element of T and if any element of T is removed, the first property no longer holds. In this paper we explore the possible values |T | can take on for a given |V |. In addition, cons...

The rotor router model is a popular deterministic analogue of a random walk on a graph. Instead of moving to a random neighbor, the neighbors are served in a fixed order. We examine how fast this “deterministic random walk” covers all vertices (or all edges). We present general techniques to derive upper bounds for the vertex and edge cover time and derive matching lower bounds for several impo...

We use mobile guards on the vertices of a graph to defend it against an infinite sequence of attacks on its edges. A guard on an incident vertex moves across the attacked edge to defend it; other guards may also move to neighboring vertices. We prove upper and lower bounds on the minimum number of guards needed for this eternal vertex cover problem and characterize the graphs for which the uppe...

We modify W. Vickrey's (1961, J. Finance 16, 8 37) mechanism for call markets by introducing the participation stage and study the efficiency properties of the modified mechanism. We provide sufficient conditions under which the modified Vickrey double auction achieves full efficiency. In addition, we prove that the modified Vickrey double auction achieves asymptotic efficiency even when full e...

Mechanical drift is a long-standing problem in optical microscopy that occurs in all three dimensions. This drift increasingly limits the resolution of advanced surface-coupled, single-molecule experiments. We overcame this drift and achieved atomic-scale stabilization (0.1 nm) of an optical microscope in 3D. This was accomplished by measuring the position of a fiducial mark coupled to the micr...