Related papers: Lattice operations for the pairwise stable set in …
In a many-to-one matching model in which firms' preferences satisfy substitutability, we study the set of worker-quasi-stable matchings. Worker-quasi-stability is a relaxation of stability that allows blocking pairs involving a firm and an…
For a many-to-many matching market, we study the lattice structure of the set of random stable matchings. We define a partial order on the random stable set and present two intuitive binary operations to compute the least upper bound and…
For a many-to-one matching model, we study the matchings obtained through the restabilization of stable matchings that had been disrupted by a change in the population. We include a simple representation of the stable matching obtained in…
We study stability notions for networked many-to-many matching markets with individually insignificant agents in distributional form. Outcomes are formulated as joint distributions over characteristics of agents and contract choices.…
This paper presents weakened notions of corewise stability and setwise stability for matching markets where agents have substitutable choice functions. We introduce the concepts of worker-quasi-core, firm-quasi-core, and worker-quasisetwise…
In this thesis, we argue that (order-) lattice-based multi-agent information systems constitute a broad class of networked multi-agent systems in which relational data is passed between nodes. Mathematically modeled as lattice-valued…
We study a one-to-one labor matching market. If a worker considers resigning from her current job to obtain a better one, how long does it take for this worker to actually get it? We present an algorithm that models this situation as a…
We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…
We consider a model of two-sided matching market where buyers and sellers trade indivisible goods with the feature that each buyer has unit demand and seller has unit supply. The result of the existence of Walrasian equilibrium and lattice…
This paper studies decentralized re-equilibration following population shocks, such as worker exits or firm entries, in many-to-many matching markets with contracts under substitutable preferences. We show that restricting any pre-shock…
We investigate the connections between some simple Maier-Saupe lattice models, with a discrete choice of orientations of the microscopic directors, and a recent proposal of a two-tensor formalism to describe the phase diagrams of nematic…
Matching of the quasi parton distribution functions between continuum and lattice is addressed using lattice perturbation theory specifically with Wilson-type fermions. The matching is done for nonlocal quark bilinear operators with a…
We revisit the problem of existence of stable systems of contracts with arbitrary sets of contracts. We show that stable sets of contracts exists if choices of agents satisfy path-independence. We call such choice functions Plott functions.…
Recently MV18 identified and initiated work on the new problem of understanding structural relationships between the lattices of solutions of two "nearby" instances of stable matching. They also gave an application of their work to finding…
Our objective is to compute the moments of the deep-inelastic structure functions of the nucleon on the lattice. A major source of uncertainty is the renormalization of the lattice operators that enter the calculation. In this talk we…
The theory of Monotone Comparative Statics (MCS) has traditionally required a lattice structure, excluding certain multidimensional environments such as mixed-strategy games where this property fails. We show that this structure is not…
A linear operator $T$ between two lattice-normed spaces is said to be $p$-compact if, for any $p$-bounded net $x_\alpha$, the net $Tx_\alpha$ has a $p$-convergent subnet. $p$-Compact operators generalize several known classes of operators…
We study a stable partial matching $\tau$ of the (possibly randomized) $d$-dimensional lattice with a stationary determinantal point process $\Psi$ on $\mathbb{R}^d$ with intensity $\alpha>1$. For instance, $\Psi$ might be a Poisson…
This paper focuses on analyzing and differentiating between lattice linear problems and algorithms. It introduces a new class of algorithms called \textit{(fully) lattice linear algorithms}. A property of these algorithms is that they…
The relaxation to equilibrium of lattice systems with long-range interactions is investigated. The timescales involved depend polynomially on the system size, potentially leading to diverging equilibration times. A kinetic equation for…