Matching Dynamics with Constraints

We study uncoordinated matching markets with additional local constraints that capture, e.g., restricted information, visibility, or externalities in markets. Each agent is a node in a fixed matching network and strives to be matched to another agent. Each agent has a complete preference list over all other agents it can be matched with. However, depending on the constraints and the current state of the game, not all possible partners are available for matching at all times. For correlated preferences, we propose and study a general class of hedonic coalition formation games that we call coalition formation games with constraints. This class includes and extends many recently studied variants of stable matching, such as locally stable matching, socially stable matching, or friendship matching. Perhaps surprisingly, we show that all these variants are encompassed in a class of "consistent" instances that always allow a polynomial improvement sequence to a stable state. In addition, we show that for consistent instances there always exists a polynomial sequence to every reachable state. Our characterization is tight in the sense that we provide exponential lower bounds when each of the requirements for consistency is violated. We also analyze matching with uncorrelated preferences, where we obtain a larger variety of results. While socially stable matching always allows a polynomial sequence to a stable state, for other classes different additional assumptions are sufficient to guarantee the same results. For the problem of reaching a given stable state, we show NP-hardness in almost all considered classes of matching games.Comment: Conference Version in WINE 201

Socially stable matchings in the hospitals / residents problem

In the Hospitals/Residents (HR) problem, agents are partitioned into hospitals and residents. Each agent wishes to be matched to an agent in the other set and has a strict preference over these potential matches. A matching is stable if there are no blocking pairs, i.e., no pair of agents that prefer each other to their assigned matches. Such a situation is undesirable as it could lead to a deviation in which the blocking pair form a private arrangement outside the matching. This however assumes that the blocking pair have social ties or communication channels to facilitate the deviation. Relaxing the stability definition to take account of the potential lack of social ties between agents can yield larger stable matchings. In this paper, we define the Hospitals/Residents problem under Social Stability (HRSS) which takes into account social ties between agents by introducing a social network graph to the HR problem. Edges in the social network graph correspond to resident-hospital pairs in the HR instance that know one another. Pairs that do not have corresponding edges in the social network graph can belong to a matching M but they can never block M. Relative to a relaxed stability definition for HRSS, called social stability, we show that socially stable matchings can have different sizes and the problem of finding a maximum socially stable matching is NP-hard, though approximable within 3/2. Furthermore we give polynomial time algorithms for three special cases of the problem

Theory of Magnetodynamics Induced by Spin Torque in Perpendicularly Magnetized Thin Films

A nonlinear model of spin wave excitation using a point contact in a thin ferromagnetic film is introduced. Large-amplitude magnetic solitary waves are computed, which help explain recent spin-torque experiments. Numerical simulations of the fully nonlinear model predict excitation frequencies in excess of 0.2 THz for contact diameters smaller than 6 nm. Simulations also predict a saturation and red shift of the frequency at currents large enough to invert the magnetization under the point contact. The theory is approximated by a cubic complex Ginzburg-Landau type equation. The mode's nonlinear frequency shift is found by use of perturbation techniques, whose results agree with those of direct numerical simulations.Comment: 5 pages, 4 figures, submitted to PR

Solitonic dispersive hydrodynamics: theory and observation

Ubiquitous nonlinear waves in dispersive media include localized solitons and extended hydrodynamic states such as dispersive shock waves. Despite their physical prominence and the development of thorough theoretical and experimental investigations of each separately, experiments and a unified theory of solitons and dispersive hydrodynamics are lacking. Here, a general soliton-mean field theory is introduced and used to describe the propagation of solitons in macroscopic hydrodynamic flows. Two universal adiabatic invariants of motion are identified that predict trapping or transmission of solitons by hydrodynamic states. The result of solitons incident upon smooth expansion waves or compressive, rapidly oscillating dispersive shock waves is the same, an effect termed hydrodynamic reciprocity. Experiments on viscous fluid conduits quantitatively confirm the soliton-mean field theory with broader implications for nonlinear optics, superfluids, geophysical fluids, and other dispersive hydrodynamic media.Comment: 8 pages, 5 figure

The metaphysics of Machian frame-dragging

The paper investigates the kind of dependence relation that best portrays Machian frame-dragging in general relativity. The question is tricky because frame-dragging relates local inertial frames to distant distributions of matter in a time-independent way, thus establishing some sort of non-local link between the two. For this reason, a plain causal interpretation of frame-dragging faces huge challenges. The paper will shed light on the issue by using a generalized structural equation model analysis in terms of manipulationist counterfactuals recently applied in the context of metaphysical enquiry by Schaffer (2016) and Wilson (2017). The verdict of the analysis will be that frame-dragging is best understood in terms of a novel type of dependence relation that is half-way between causation and grounding

Network Creation Games: Think Global - Act Local

We investigate a non-cooperative game-theoretic model for the formation of communication networks by selfish agents. Each agent aims for a central position at minimum cost for creating edges. In particular, the general model (Fabrikant et al., PODC'03) became popular for studying the structure of the Internet or social networks. Despite its significance, locality in this game was first studied only recently (Bil\`o et al., SPAA'14), where a worst case locality model was presented, which came with a high efficiency loss in terms of quality of equilibria. Our main contribution is a new and more optimistic view on locality: agents are limited in their knowledge and actions to their local view ranges, but can probe different strategies and finally choose the best. We study the influence of our locality notion on the hardness of computing best responses, convergence to equilibria, and quality of equilibria. Moreover, we compare the strength of local versus non-local strategy-changes. Our results address the gap between the original model and the worst case locality variant. On the bright side, our efficiency results are in line with observations from the original model, yet we have a non-constant lower bound on the price of anarchy.Comment: An extended abstract of this paper has been accepted for publication in the proceedings of the 40th International Conference on Mathematical Foundations on Computer Scienc