In matching games, agents are rivals to match with the most attractive partners. I examine the nonparametric identification and estimation of match production functions in matching games with endogenous transfers. Inequalities derived from single-agent best responses underly a nonparametric maximum score estimator of match production functions. The inequalities do not require data on transfers,...

More and more, databases are combined using record linkage methods to increase the amount of available information. When there is no unique identifier to perform the matching, a probabilistic linkage is used. A record on the first file is linked to a record on the second file with a certain probability, and then a decision is made on whether this link is a true link or not. This process usually...

In two-sided and coalition matching games, agents must all agree for a match to be formed, and agents can make only a finite number of matches. I examine the nonparametric identification and estimation of match production functions in matching games with endogenous prices and transferable utility. Inequalities derived from necessary conditions for equilibrium underly a nonparametric maximum sco...

Twenty-five years ago, Horace Newcomb and Paul Hirsch proposed a model for studying television as a cultural forum, as the most common reference point for public issues and concerns, particularly in American society. Over the last decade, the internet has emerged as a new communicative infrastructure and cultural forum on a global scale. Revisiting and reworking Newcomb and Hirsch’s classic con...

Tree-based reliable multicast protocols are known to be most scalable for one-to-many sessions. However, there is still an open question whether these protocols are also scalable for many-to-many sessions. We categorize existing tree-based protocols into four classes according to feedback/retransmission policies employed, and analyze and compare them based on a spatial loss model proposed in th...

When aligning very different language pairs, the most important needs are the use of structural information and the capability of generating one-to-many or many-to-many correspondences. In this paper, we propose a novel phrase alignment method which models word or phrase dependency relations in dependency tree structures of source and target languages. The dependency relation model is a kind of...

Negotiation is a technique for reaching mutually beneficial agreement among agents via communication. A concurrent negotiation problem occurs when an agent needs to negotiate with multiple agents to reach agreement. In this paper, we present a protocol to support many-to-many bilateral multiple-issue negotiation in a competitive environment. The protocol is presented in the context of service-o...

In this paper, we propose a novel communication paradigm called group-oriented communication. Different from conventional unicast-based communications, group-oriented communication is based on group-based communications. Group-oriented communication is a type of many-to-many communication, but it realizes any type of communications covering one-to-one, one-to-many, many-to-one, and many-to-many...

Telecloning and its reverse process, referred to as remote information concentration (RIC), have attracted considerable interest because of their potential applications in quantum-information processing. We here present a general scheme for RIC in d-level systems (qudits), in which the quantum information initially distributed in many spatially separated qudits can be remotely and deterministic...