Directed path-width was defined by Reed, Thomas and Seymour around 1995. The author and P. Hajnal defined a cops-and-robber game on digraphs in 2000. We prove that the two notions are closely related and for any digraph D, the corresponding graph parameters differ by at most one. The result is achieved using the mixed-search technique developed by Bienstock and Seymour. A search is called monot...

In two-sided multi-unit auctions having a variety of payment rules, including uniform-price and discriminatory auctions, a monotone pure strategy equilibrium (MPSE) exists when bidders are risk-neutral with independent multi-dimensional types and interdependent values. In fact, all mixed strategy equilibria are ex post allocationand interim expected payment-equivalent to MPSE. Thus, for standar...

We consider the connected variant of the classic mixed search game where, in each search step, cleaned edges form a connected subgraph. We consider graph classes with bounded connected monotone mixed search number and we deal with the the question weather the obstruction set, with respect of the contraction partial ordering, for those classes is finite. In general, there is no guarantee that th...

We introduce a hybrid iterative scheme for finding a common element of the set of solutions for a system of mixed equilibrium problems, the set of common fixed point for nonexpansive semigroup, and the set of solutions of the quasi-variational inclusion problem with multivalued maximal monotone mappings and inverse-strongly monotone mappings in Hilbert space. Under suitable conditions, some str...

Abstract: In this paper, we establish a new coupled coincidence point results in partially ordered probabilistic metric spaces by utilizing the Gauge function. We use the compatibility condition between two mappings. We use monotone and mixed monotone properties of functions with respect to the ordering. Our main result has several corollaries. The main result is supported with an example which...

We prove a new lower bound on the randomized decision tree complexity of monotone graph properties. For a monotone graph property $A$ of graphs on $n$ vertices, let $p=p(A)$ denote the threshold probability of $A$, namely the value of $p$ for which a random graph from $G(n,p)$ has property $A$ with probability $1/2$. Then the expected number of queries made by any decision tree for $A$ on such ...

I develop a matching model with heterogeneous workers, firms, and worker-firm matches, and apply it to longitudinal linked data on employers and employees. Workers vary in their marginal product when employed. Firms vary in their marginal product and cost of maintaining a vacancy. The marginal product of a worker-firm match also depends on a match-specific interaction between worker and firm th...

We discuss an extension of the Buckley-Leverett (BL) equation describing twophase flow in porous media. This extension includes a third order mixed derivatives term and models the dynamic effects in the pressure difference between the two phases. We derive existence conditions for traveling wave solutions of the extended model. This leads to admissible shocks for the original BL equation, which...

In this article, we study a class of mixed monotone operators with perturbations. Using a monotone iterative technique and the properties of cones, we show the existence and uniqueness for fixed points for such operators. As applications, we prove the existence and uniqueness of positive solutions for nonlinear integral equations of second-order on time scales. In particular, we do not assume t...