Instance-Based Learning Algorithms
Machine Learning
Technical Note: \cal Q-Learning
Machine Learning
Yenta: a multi-agent, referral-based matchmaking system
AGENTS '97 Proceedings of the first international conference on Autonomous agents
A tutorial on learning with Bayesian networks
Proceedings of the NATO Advanced Study Institute on Learning in graphical models
Dynamic pricing by software agents
Computer Networks: The International Journal of Computer and Telecommunications Networking - electronic commerce
Proceedings of the 6th international conference on Intelligent user interfaces
An economic paradigm for query processing and data migration in mariposa
PDIS '94 Proceedings of the third international conference on on Parallel and distributed information systems
Hermes: A Distributed Event-Based Middleware Architecture
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
Stimulating cooperation in self-organizing mobile ad hoc networks
Mobile Networks and Applications
A survey of peer-to-peer content distribution technologies
ACM Computing Surveys (CSUR)
A subjective approach to routing in P2P and ad hoc networks
iTrust'03 Proceedings of the 1st international conference on Trust management
An overview of pricing concepts for broadband IP networks
IEEE Communications Surveys & Tutorials
| Hi-index | 0.00 |
Scalability and efficient global search in large-scale peer-to-peer overlays often come at the expense of small-scale, local interactions between peers. For many users, local operations such as browsing, messaging, and direct content exchange between nodes may be more useful than access to the network as a whole. In this note we sketch the design of a small-scale overlay for applications such as ticketing systems, editorial coordination, and ad hoc workflows that currently rely on more general and less efficient mediums such as e-mail. Peers in the overlay form local economies and attempt to maximize user-directed utility functions.