Agents in two-sided matching games vary in characteristics that are unobservable in typical data on matching markets. We investigate the identification of the distribution of unobserved characteristics using data on who matches with whom. In full generality, we consider many-to-many matching and matching with trades. The distribution of match-specific unobservables cannot be fully recovered wit...

We study second-degree price discrimination in markets where the product traded by the monopolist is access to other agents. We derive necessary and sufficient conditions for the welfareand the profit-maximizing mechanisms to employ a single network or a menu of non-exclusive networks. We characterize the optimal matching schedules under a wide range of preferences, derive implications for pric...

This paper presents a chain of model transformations to guide and support the application of the INGENIAS development process. The MTGenerator tool generates these transformations with a Model Transformation By-Example approach, that is, automatically from pairs of model prototypes. The MTGenerator has the advantage over similar approaches and tools of being able to generate many-to-many transf...

The existing Internet architecture and protocols are not suitable for the newly emerging ad hoc collaborative computing systems. New architectures, protocols, and middleware specifically designed for the new ad hoc collaborative computing systems are needed. While work is currently being done to adapt the Internet architecture and protocols so the new systems can be developed and deployed, the ...

In this paper we study the problem of hair interpolation: given two 3D hair models, we want to generate a sequence of intermediate hair models that transform from one input to another both smoothly and aesthetically pleasing. We propose an automatic method that efficiently calculates a many-to-many strand correspondence between two or more given hair models, taking into account the multi-scale ...

The current state-of-the-art in electronic negotiations shows a focus on the trade of standardised mostly inexpensive products in fixed networks of suppliers and customers. To overcome these shortcomings, the goal must be to enable the trade of complex and valuable goods and to support many-to-many marketplace for that purpose. Once valuable goods are concerned, the trade process involves negot...

Because of the wealth of new phenomena which the condensates display, and the precision and flexibility with which they can be manipulated, interest in them has grown explosively in communities of atomic physics, quantum optics, and many-body physics. At least twenty groups have created condensates, and the publication rate on BoseEinstein condensation has soared following the discovery of the ...

In this paper we present the next iteration in our study of wearable and mobile haptic communication, proposing to conduct a many-to-many haptic communication experiment over time. We wish to present the project and results in both the Demo and Poster format.

A k-disjoint path cover of a graph is defined as a set of k internally vertexdisjoint paths connecting given sources and sinks in such a way that every vertex of the graph is covered by a path in the set. In this paper, we analyze the k-disjoint path cover of recursive circulant G(2m, 4) under the condition that at most f faulty vertices and/or edges are removed. It is shown that whenm ≥ 3, G(2...

A number of research and software development groups have developed technology for identifying terms and names in documents and associating them with concepts and named entities, but few have addressed coreference of concepts and entities across multiple documents in a collection. Cross-document coreference is challenging, since a collection of documents consists of multiple discourse contexts,...