We propose the PeerRank method for peer assessment. This constructs a grade for an agent based on the grades proposed by the agents evaluating the agent. Since the grade of an agent is a measure of their ability to grade correctly, the PeerRank method weights grades by the grades of the grading agent. The PeerRank method also provides an incentive for agents to grade correctly. As the grades of an agent depend on the grades of the grading agents, and as these grades themselves depend on the grades of other agents, we define the PeerRank method by a fixed point equation similar to the PageRank method for ranking web-pages. We identify some formal properties of the PeerRank method (for example, it satisfies axioms of unanimity, no dummy, no discrimination and symmetry), discuss some examples, compare with related work and evaluate the performance on some synthetic data. Our results show considerable promise, reducing the error in grade predictions by a factor of 2 or more in many cases over the natural baseline of averaging peer grades.
A closely related problem is the division of cash between a group of partners @cite_11 . Each partner cares selfishly about their share but is supposed to be disinterested about the distribution of the money that he or she does not get. Partners rate the relative contributions of the other partners. With four or more partners, there exist symmetric and impartial division rules. By comparison, whilst our PeerRank rule is symmetric, it is not designed to be impartial. The grades assigned by an agent can definitely influence their final grade.
@cite_11
2091152488
This article explores how the efficiency of Internet search is changing the way Americans find romantic partners. We use a new data source, the How Couples Meet and Stay Together survey. Results show that for 60 years, family and grade school have been steadily declining in their influence over the dating market. In the past 15 years, the rise of the Internet has partly displaced not only family and school, but also neighborhood, friends, and the workplace as venues for meeting partners. The Internet increasingly allows Americans to meet and form relationships with perfect strangers, that is, people with whom they had no previous social tie. Individuals who face a thin market for potential partners, such as gays, lesbians, and middle-aged heterosexuals, are especially likely to meet partners online. One result of the increasing importance of the Internet in meeting partners is that adults with Internet access at home are substantially more likely to have partners, even after controlling for other factors.... The set of optimal matchings in the assignment matrix allows to define a reflexive and symmetric binary relation on each side of the market, the equal-partner binary relation. The number of equivalence classes of the transitive closure of the equal-partner binary relation determines the dimension of the core of the assignment game. This result provides an easy procedure to determine the dimension of the core directly from the entries of the assignment matrix and shows that the dimension of the core is not as much determined by the number of optimal matchings as by their relative position. This paper provides the first comprehensive analysis of Uber's driver-partners, based on both survey data and anonymized, aggregated administrative data. Uber has grown at an exponential rate over the last few years, and drivers who partner with Uber appear to be attracted to the platform in large part because of the flexibility it offers, the level of compensation, and the fact that earnings per hour do not vary much with hours worked, which facilitates part-time and variable hours. Uber's driver-partners are more similar in terms of their age and education to the general workforce than to taxi drivers and chauffeurs. Uber may serve as a bridge for many seeking other employment opportunities, and it may attract well-qualified individuals because, with Uber's star rating system, driver-partners' reputations are explicitly shared with potential customers. Most of Uber's driver-partners had full- or part-time employment prior to joining Uber, and many continued in those positions after starting to drive with the Uber platform, which makes the flexibility to set their own hours all the more valuable. Uber's driver-partners also often cited the desire to smooth fluctuations in their income as a reason for partnering with Uber. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for every cheating man to get a better partner than the one he gets if everyone is truthful. We study how to circumvent this theorem and incite men to cheat. First we devise coalitions in which a nonempty subset of the liars get better partners and no man is worse off than before. This strategy is limited in that not everyone in the coalition has the incentive to falsify his list. In an attempt to rectify this situation we introduce the element of randomness, but the theorem shows surprising robustness: it is impossible that every liar has a chance to improve the rank of his partner while no one gets hurt. To overcome the problem that some men lack the motivation to lie, we exhibit another randomized lying strategy in which every liar can expect to get a better partner on average, though with a chance of getting a worse one. Finally, we consider a variant scenario: instead of using the Gale-Shapley algorithm, suppose the stable matching is chosen at random. We present a modified form of the coalition strategy ensuring that every man in the coalition has a new probability distribution over partners which majorizes the original one. A group of peers must choose one of them to receive a prize; everyone cares only about winning, not about who gets the prize if someone else. An award rule is impartial if one's message never influences whether or not one wins the prize. We explore the consequences of impartiality when each agent nominates a single (other) agent for the prize. @PARASPLIT On the positive side, we construct impartial nomination rules where both the influence of individual messages and the requirements to win the prize are not very different across agents. Partition the agents in two or more districts, each of size at least 3, and call an agent a local winner if he is nominated by a majority of members of his own district; the rule selects a local winner with the largest support from nonlocal winners, or a fixed default agent in case there is no local winner. @PARASPLIT On the negative side, impartiality implies that ballots cannot be processed anonymously as in plurality voting. Moreover, we cannot simultaneously guarantee that the winner always gets at least one nomination, and that an agent nominated by everyone else always wins. Collaborative robots represent a clear added value to manufacturing, as they promise to increase productivity and improve working conditions of such environments. Although modern robotic systems have become safe and reliable enough to operate close to human workers on a day-to-day basis, the workload is still skewed in favor of a limited contribution from the robot's side, and a significant cognitive load is allotted to the human. We believe the transition from robots as recipients of human instruction to robots as capable collaborators hinges around the implementation of transparent systems, where mental models about the task are shared between peers, and the human partner is freed from the responsibility of taking care of both actors. In this work, we implement a transparent task planner able to be deployed in realistic, near-future applications. The proposed framework is capable of basic reasoning capabilities for what concerns role assignment and task allocation, and it interfaces with the human partner at the level of abstraction he is most comfortable with. The system is readily available to non-expert users, and programmable with high-level commands in an intuitive interface. Our results demonstrate an overall improvement in terms of completion time, as well as a reduced cognitive load for the human partner. OBJECTIVES: This study sought to define, among sexually transmitted disease (STD) clinic attendees, (1) patterns of sex partner selection, (2) relative risks for gonococcal or chlamydial infection associated with each mixing pattern, and (3) selected links and potential and actual bridge populations. METHODS: Mixing matrices were computed based on characteristics of the study participants and their partners. Risk of infection was determined in study participants with various types of partners, and odds ratios were used to estimate relative risk of infection for discordant vs concordant partnerships. RESULTS: Partnerships discordant in terms of race ethnicity, age, education, and number of partners were associated with significant risk for gonorrhea and chlamydial infection. In low-prevalence subpopulations, within-subpopulation mixing was associated with chlamydial infection, and direct links with high-prevalence subpopulations were associated with gonorrhea. CONCLUSIONS: Mixing patterns influence the ris... We consider a multiuser two-way relay network where multiple pairs of users communicate with their preassigned partners, using a common intermediate relay node, in a two-phase communication scenario employing code division multiple access (CDMA). By taking advantage of the bidirectional communication structure, we first propose that each pair of partners share a common spreading signature and design a jointly demodulate-and-XOR forward (JD-XOR-F) relaying scheme, where all users transmit to the relay simultaneously followed by the relay broadcasting an estimate of the XORed symbol for each user pair. We derive the decision rules and the corresponding bit error rates (BERs) at the relay and at the users' receivers. We then investigate the joint power control and receiver optimization problem for each phase for this multiuser two-way relay network with JD-XOR-F relaying. We solve each optimization problem by constructing the iterative power control and receiver updates that converge to the corresponding unique optimum. Simulation results are presented to demonstrate the performance of the proposed multiuser two-way JD-XOR-F relaying scheme in conjunction with the joint power control and receiver optimization algorithms. Specifically, we observe significant power savings and user capacity improvement with the proposed communication scheme as compared to the designs with a "one-way" communication perspective. Scrip systems provide a nonmonetary trade economy for exchange of resources. We model a scrip system as a stochastic game and study system design issues on selection rules to match potential trade partners over time. We show the optimality of one particular rule in terms of maximizing social welfare for a given scrip system that guarantees players' incentives to participate. We also investigate the optimal number of scrips to issue under this rule. In particular, if the time discount factor is close enough to one, or trade benefits one partner much more than it costs the other, the maximum social welfare is always achieved no matter how many scrips are in the system. When the benefit of trade and time discount are not sufficiently large, on the other hand, injecting more scrips in the system hurts most participants; as a result, there is an upper bound on the number of scrips allowed in the system, above which some players may default. We show that this upper bound increases with the discount factor as we... We present a computational framework for understanding the social aspects of emotions in Twitter conversations. Using unannotated data and semisupervised machine learning, we look at emotional transitions, emotional influences among the conversation partners, and patterns in the overall emotional exchanges. We find that conversational partners usually express the same emotion, which we name Emotion accommodation, but when they do not, one of the conversational partners tends to respond with a positive emotion. We also show that tweets containing sympathy, apology, and complaint are significant emotion influencers. We verify the emotion classification part of our framework by a human-annotated corpus. For impartial division, each participant reports only her opinion about the fair relative shares of the other participants, and this report has no effect on her own share. If a specific division is compatible with all reports, it is implemented. We propose a family of natural methods meeting these requirements, for a division among four or more participants. No such method exists for a division among three participants. We present a novel peer-to-peer backup technique that allows computers connected to the Internet to back up their data cooperatively: Each computer has a set of partner computers, which collectively hold its backup data. In return, it holds a part of each partner's backup data. By adding redundancy and distributing the backup data across many partners, a highly-reliable backup can be obtained in spite of the low reliability of the average Internet machine. Because our scheme requires cooperation, it is potentially vulnerable to several novel attacks involving free riding (e.g., holding a partner's data is costly, which tempts cheating) or disruption. We defend against these attacks using a number of new methods, including the use of periodic random challenges to ensure partners continue to hold data and the use of disk-space wasting to make cheating unprofitable. Results from an initial prototype show that our technique is feasible and very inexpensive: it appears to be one to two orders of magnitude cheaper than existing Internet backup services. Previous acoustic analysis of fundamental frequencies from interview partners' voices revealed mutual accommodation of voice frequency and amplitude. These findings also showed partners' accommodation was associated with such attributes as social status. However, previous studies did not assess the function of partners' voice accommodation in extending general communication quality. The present study employs an experimental protocol wherein the fundamental frequency is included in some conversations and filtered from others to show, first, that partners do actively accommodate the fundamental frequency of their voices, and, second, that elimination of the fundamental frequency from conversation partners' voices profoundly alters perceived positive evaluations by judges overhearing the conversation. This experiment specifies an important auxiliary role for the fundamental frequency in nonverbal communication. This paper proposes a network coding approach to cooperative diversity featuring the algebraic superposition of channel codes over a finite field. The scenario under consideration is one in which two ldquopartnersrdquo - node A and node B - cooperate in transmitting information to a single destination; each partner transmits both locally generated information and relayed information that originated at the other partner. A key observation is that node B already knows node A's relayed information (because it originated at node B) and can exploit that knowledge when decoding node A's local information. This leads to an encoding scheme in which each partner transmits the algebraic superposition of its local and relayed information, and the superimposed codeword is interpreted differently at the two receivers i.e., at the other partner and at the destination node, based on their different a priori knowledge. Decoding at the destination is then carried out by iterating between the codewords from the two partners. It is shown via simulation that the proposed scheme provides substantial coding gain over other cooperative diversity techniques, including those based on time multiplexing and signal (Euclidean space) superposition. For a system of distributed processes, correctness can be ensured by (statically) checking whether their composition satisfies properties of interest. In contrast, Web services are being designed so that each partner discovers properties of others dynamically, through a published interface. Since the overall system may not be available statically and since each business process is supposed to be relatively simple, we propose to use runtime monitoring of conversations between partners as a means of checking behavioural correctness of the entire web service system. Specifically, we identify a subset of UML 2.0 Sequence Diagrams as a property specification language and show that it is sufficiently expressive for capturing safety and liveness properties. By transforming these diagrams to automata, we enable conformance checking of finite execution traces against the specification. We describe an implementation of our approach as part of an industrial system and report on preliminary experience. In this paper, adaptive impedance control is proposed for a robot collaborating with a human partner, in the presence of unknown motion intention of the human partner and unknown robot dynamics. Human motion intention is defined as the desired trajectory in the limb model of the human partner, which is extremely difficult to obtain considering the nonlinear and time-varying property of the limb model. Neural networks are employed to cope with this problem, based on which an online estimation method is developed. The estimated motion intention is integrated into the developed adaptive impedance control, which makes the robot follow a given target impedance model. Under the proposed method, the robot is able to actively collaborate with its human partner, which is verified through experiment studies. To engage in cooperative activities with human partners, robots have to possess basic interactive abilities and skills. However, programming such interactive skills is a challenging task, as each interaction partner can have different timing or an alternative way of executing movements. In this paper, we propose to learn interaction skills by observing how two humans engage in a similar task. To this end, we introduce a new representation called Interaction Primitives. Interaction primitives build on the framework of dynamic motor primitives (DMPs) by maintaining a distribution over the parameters of the DMP. With this distribution, we can learn the inherent correlations of cooperative activities which allow us to infer the behavior of the partner and to participate in the cooperation. We will provide algorithms for synchronizing and adapting the behavior of humans and robots during joint physical activities. Future robots must co-exist and directly interact with human beings. Designing these agents imply solving hard problems linked to human-robot interaction tasks. For instance, how a robot can choose an interacting partner among various agents and how a robot locates regions of interest in its visual field. Studies of neurobiology and psychology collectively named synchrony as an indispensable parameter for social interaction. We assumed that Human-Robot interaction could be initiated by synchrony detection. In this paper, we present a developmental approach for analyzing unintentional synchronization in human-robot interaction. Using our neural network model, the robot learns from a babbling step its inner dynamics by associating its own motor activities (oscillators) with the visual stimulus induced by its own motion. After learning the robot is capable of choosing an interacting agent and of localizing the spatial position of its preferred partner by synchrony detection. Abstract Many studies document how individuals use Facebook to meet partners or develop and maintain relationships. Less is known about information-seeking behaviors during the stages of relationship termination. Relational dissolution is a socially embedded activity, and affordances of social network sites offer many advantages in reducing uncertainty after a breakup. A survey collected responses from 110 individuals who use Facebook to gather information about their romantic ex-partners. Results indicated that after breakup, partners may take advantage of the system's information visibility and the relative invisibility of movement depending on relational factors (initiator role and breakup uncertainty), social factors (perceived network approval of Facebook surveillance), and individual privacy concerns. This investigation addresses questions such as what type of information-seeking foci do individuals employ and how do individuals use Facebook as a form of surveillance? What factors motivate surveilla... We propose the PeerRank method for peer assessment. This constructs a grade for an agent based on the grades proposed by the agents evaluating the agent. Since the grade of an agent is a measure of their ability to grade correctly, the PeerRank method weights grades by the grades of the grading agent. The PeerRank method also provides an incentive for agents to grade correctly. As the grades of an agent depend on the grades of the grading agents, and as these grades themselves depend on the grades of other agents, we define the PeerRank method by a fixed point equation similar to the PageRank method for ranking web-pages. We identify some formal properties of the PeerRank method (for example, it satisfies axioms of unanimity, no dummy, no discrimination and symmetry), discuss some examples, compare with related work and evaluate the performance on some synthetic data. Our results show considerable promise, reducing the error in grade predictions by a factor of 2 or more in many cases over the natural baseline of averaging peer grades.