Pseudo-depth monotonicity condition is an important assumption of the inverse scattering internal multiple attenuation algorithm. Analysis reveals that this condition is equivalent to a vertical-time monotonicity condition which is different than the total traveltime monotonicity suggested in recent literature/discussions. For certain complex media, the monotonicity condition can be too restric...

We characterize full implementation of social choice sets in mixedstrategy Bayesian equilibrium. Our results concern both exact and virtual mixed implementation. For exact implementation, we identify a strengthening of Bayesian monotonicity, which we refer to as mixed Bayesian monotonicity. It is shown that, in economic environments with at least three agents, mixed Bayesian implementation is e...

A new monotonicity principle and an L stability theorem are es tablished for a discrete obstacle problem which is de ned by a piece wise linear nite element discretization of a continuous problem This discrete monotonicity principle extends the discrete maximum princi ple of Ciarlet from linear equations to obstacle problems As an application of the monotonicity principle and the L stability th...

A new condition, which we call uniform monotonicity, is shown to be necessary and almost sufficient for rationalizable implementation of correspondences. Uniform monotonicity is much weaker than Maskin monotonicity and reduces to it in the case of functions. Maskin monotonicity, the key condition for Nash implementation, had also been shown to be necessary for rationalizable implementation of s...

We study the construction of the minimum cost spanning geometric graph of a given rooted point set P where each point of P is connected to the root by a path that satisfies a given property. We focus on two properties, namely the monotonicity w.r.t. a single direction (y-monotonicity) and the monotonicity w.r.t. a single pair of orthogonal directions (xy-monotonicity). We propose algorithms tha...

The notion of polygon monotonicity has been well researched to be used as an important property for various geometric problems. This notion can be more extended for categorizing the boundary shapes of polyhedrons, but it has not been explored enough yet. This paper characterizes three types of polyhedron monotonicity: strong-, weak-, and directional-monotonicity: (Toussaint, 1985). We reexamine...

Monotonicity under coarse-graining is a crucial property of the quantum relative entropy. The aim of this paper is to investigate the condition of equality in the monotonicity theorem and in its consequences as the strong sub-additivity of von Neumann entropy, the Golden-Thompson trace inequality and the monotonicity of the Holevo quantitity. The relation to quantum Markov states is briefly ind...