Multi-organizational EDI message networks are complicated communication environments with various standards and technologies. The role of third party message exchange hubs has bec...
We discuss a solution to the winner determination problem which takes into account not only costs but also risk aversion of the agent that accepts the bids. We are interested in b...
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
A multi-agent marketplace, MAGNET (Multi AGent Negotiation Testbed), is a promising solution to conduct online combinatorial auctions. The trust model of MAGNET is somewhat diffe...
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
In this paper we present a B2B integration project, which aims to augment the added value of services instead of improving efficiency by automating processes. This paper introduce...
The Platform for Privacy Preferences (P3P) provides a standard computer-readable format for privacy policies and a protocol that enables web browsers to read and process these pol...
Simon Byers, Lorrie Faith Cranor, David P. Kormann
We develop two algorithms to manage bid data in flexible, multi-unit double auctions. The first algorithm is a multi-unit extension of the 4-HEAP algorithm, and the second is a ...
Online auctions are increasingly being used as a medium to procure goods and services. As the number of auction sites increases, however, consumers will inevitably want to track a...