Related papers: Pseudo-Substitutability: A Maximal Domain for Pair…
The problem of allocating scarce items to individuals is an important practical question in market design. An increasingly popular set of mechanisms for this task uses the concept of market equilibrium: individuals report their preferences,…
We analyze the stability properties of equilibrium solutions and periodicity of orbits in a two-dimensional dynamical system whose orbits mimic the evolution of the price of an asset and the excess demand for that asset. The construction of…
Motivated by growing evidence of agents' mistakes in strategically simple environments, we propose a solution concept -- robust equilibrium -- that requires only an asymptotically optimal behavior. We use it to study large random matching…
We study balanced exchange problems in which agents with responsive preferences are endowed with multiple indivisible objects and can trade without transfers (e.g. shift exchange, time-banking). Eliciting full preferences over bundles is…
In many real-world matching applications, there are restrictions for institutions either on priorities of their slots or on the transferability of unfilled slots over others (or both). Motivated by the need in such real-life matching…
Conformal prediction offers a distribution-free framework for constructing prediction sets with coverage guarantees. In practice, multiple valid conformal prediction sets may be available, arising from different models or methodologies.…
In the object reallocation problem, achieving Pareto-efficiency is desirable, but may be too demanding for implementation purposes. In contrast, pair-efficiency, which is the minimal efficiency requirement, is more suitable. Despite being a…
We study rings of real-valued continuous functions in terms of pseudocomplementation conditions on various lattices attached to their prime spectrum. We fully characterize pseudocomplementation in all cases and have an almost complete…
We study deviations by a group of agents in the three main types of matching markets: the house allocation, the marriage, and the roommates models. For a given instance, we call a matching $k$-stable if no other matching exists that is more…
We present a mechanism for computing asymptotically stable school optimal matchings, while guaranteeing that it is an asymptotic dominant strategy for every student to report their true preferences to the mechanism. Our main tool in this…
We study two-sided many-to-one matching markets with transferable utilities, e.g., labor and rental housing markets, in which money can exchange hands between agents, subject to distributional constraints on the set of feasible allocations.…
A group of $n$ agents with numerical preferences for each other are to be assigned to the $n$ seats of a dining table. We study two natural topologies:~circular (cycle) tables and panel (path) tables. For a given seating arrangement, an…
Determining a stability domain, i.e. a set of equilibria for which a dynamical system remains stable, is a core problem in control. When dealing with controlled systems, the problem is generally transformed into a robustness analysis…
We study a dynamic model of the relationship between two people where the states depend on the "power" in the relationship. We perform a comprehensive analysis of stability of the system, and determine a set of conditions under which stable…
We propose a distributionally robust principal agent formulation, which generalizes some common variants of worst-case and Bayesian principal agent problems. We construct a theoretical framework to certify whether any surjective contract…
In this paper we analyse a dynamic model of investment under uncertainty in a duopoly, in which each firm has an option to switch from the present market to a new market. We construct a subgame perfect equilibrium in mixed strategies and…
We consider as given a discrete time financial market with a risky asset and options written on that asset and determine both the sub- and super-hedging prices of an American option in the model independent framework of ArXiv:1305.6008. We…
Probabilistic forecasting in combination with stochastic programming is a key tool for handling the growing uncertainties in future energy systems. Derived from a general stochastic programming formulation for the optimal scheduling and…
We propose a new way of thinking about one parameter persistence. We believe topological persistence is fundamentally not about decomposition theorems but a central role is played by a choice of metrics. Choosing a pseudometric between…
The theory of optimal choice sets is a solution theory that has a long and well-established tradition in social choice and game theories. Some of important general solution concepts of choice problems when the set of best alternatives does…