Sciweavers

116 search results - page 15 / 24
» Selling Privacy at Auction
Sort
View
WPES
2005
ACM
15 years 3 months ago
The privacy cost of the second-chance offer
This paper examines a generalization of a two-stage game common on eBay: an ascending-price auction followed by price discrimination (the second chance offer). High bids in the a...
Sumit Joshi, Yu-An Sun, Poorvi L. Vora
JCP
2006
135views more  JCP 2006»
14 years 10 months ago
Improved Double Auction Protocol based on a Hybrid Trust Model
Recently, Wang et al. proposed a set of double auction protocols with full privacy protection based on distributed ElGamal encryption. Unfortunately, their protocols are expensive ...
JungHoon Ha, Jianying Zhou, Sang-Jae Moon
AGENTS
1998
Springer
15 years 2 months ago
Market-Based Resource Control for Mobile Agents
Mobile agents are programs that can migrate from machine to machine in a heterogeneous, partially disconnected network. As mobile agents move across a network, they consume resour...
Jonathan Bredin, David Kotz, Daniela Rus
JACM
2006
134views more  JACM 2006»
14 years 10 months ago
Online algorithms for market clearing
In this article, we study the problem of online market clearing where there is one commodity in the market being bought and sold by multiple buyers and sellers whose bids arrive an...
Avrim Blum, Tuomas Sandholm, Martin Zinkevich
SIGECOM
2004
ACM
165views ECommerce» more  SIGECOM 2004»
15 years 3 months ago
Adaptive limited-supply online auctions
We study a limited-supply online auction problem, in which an auctioneer has k goods to sell and bidders arrive and depart dynamically. We suppose that agent valuations are drawn ...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Da...