We show that, when bidders have continuous valuations, any ex post equilibrium in an ex post individually rational query auction can only be ex post efficient when the running time of the auction is infinite for almost all realizations of valuations of the bidders. We also show that this result applies to the general class of bisection auctions. In contrast we show that, when we allow for ineff...

A bisection sampling method is implemented in the framework of a quantized classical path algorithm to include nuclear quantum effects in path integral simulations. The present study examines the convergence of these calculations on two model systems with respect to the number of beads used in the polymer chain and the number of configurations both in free-particle sampling and in classical con...

W ABSTRACT e describe a bisection method to determine the 2-norm and Frobenius norm-g distance from a given matrix A to the nearest matrix with an eigenvalue on the ima inary axis. If A is stable in the sense that its eigenvalues lie in the open left half e plane, then this distance measures how "nearly unstable" A is. Each step provides ither a rigorous upper bound or a rigorous lower bound on...

In this paper, two methods that are capable to efficiently partition 3-D unstructured grids for parallel processing, will be presented. Implicit to either of these methods are a recursive bisection pattern, a multilevel acceleration scheme and local refinement heuristics. Although both are based on Genetic Algorithms (GAs), their concept and formulation are completely different. The first metho...

The line-bisection task, adapted to utilise a wooden rod as the bisection stimulus, has revealed that patients with visuo-spatial neglect may be more accurate at bisection when asked to pick up the rod, compared to pointing to its centre. We recently reported that neurologically intact participants show a similar dissociation on this task-demonstrating a rightward bias when pointing to the cent...

We give a polynomial time algorithm that given a graph which admits a bisection cutting a fraction (1 − ε) of edges, finds a bisection cutting a (1 − g(ε)) fraction of edges where g(ε) → 0 as ε→ 0. One can take g(ε) = O( 3 √ ε log(1/ε)). Previously known algorithms for Max Bisection could only guarantee finding a bisection that cuts a fraction of edges bounded away from 1 (in fact less than 3/4...