Sciweavers

41 search results - page 2 / 9
» Competitive auctions and digital goods
Sort
View
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
13 years 6 months ago
Competitiveness via consensus
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...
Andrew V. Goldberg, Jason D. Hartline
HICSS
2008
IEEE
108views Biometrics» more  HICSS 2008»
13 years 12 months ago
Free-Riding and Competition in Network Markets for Digital Goods
— We present a continuous, stochastic model — the first of its kind — for the monetary flow in multi-level markets allowing for the quantitative assessment of the incentive...
Andreas U. Schmidt
SRDS
1999
IEEE
13 years 9 months ago
On the Provision of Replicated Internet Auction Services
The paper presents the design of a software infrastructure that can support negotiation and competition among buyers and sellers of goods (auctioning) over the Internet. The goals...
Fabio Panzieri, Santosh K. Shrivastava
SIGECOM
2005
ACM
169views ECommerce» more  SIGECOM 2005»
13 years 11 months ago
Online auctions with re-usable goods
This paper concerns the design of mechanisms for online scheduling in which agents bid for access to a re-usable resource such as processor time or wireless network access. Each a...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Mo...
AGENTS
1998
Springer
13 years 9 months ago
Competitive Scenarios for Heterogeneous Trading Agents
We present a framework for de ning trading scenarios based on sh market auctions. In these scenarios, agents of arbitrary complexity can participate in electronic auctions under ...
Juan A. Rodríguez-Aguilar, Francisco J. Mar...