Sciweavers

Share
SIGECOM
2004
ACM
132views ECommerce» more  SIGECOM 2004»
9 years 9 months ago
A dynamic pari-mutuel market for hedging, wagering, and information aggregation
I develop a new mechanism for risk allocation and information speculation called a dynamic pari-mutuel market (DPM). A DPM acts as hybrid between a pari-mutuel market and a contin...
David M. Pennock
SIGECOM
2004
ACM
129views ECommerce» more  SIGECOM 2004»
9 years 9 months ago
Evaluating example-based search tools
A crucial element in consumer electronic commerce is a catalog tool that not only finds the product for the user, but also convinces him that he has made the best choice. To do th...
Pearl Huan Z. Pu, Pratyush Kumar
SIGECOM
2004
ACM
115views ECommerce» more  SIGECOM 2004»
9 years 9 months ago
Limited reputation sharing in P2P systems
The increasing popularity of resource exchange through peerto-peer networks has encouraged the development of ways to support more complex commercial transactions over these netwo...
Sergio Marti, Hector Garcia-Molina
SIGECOM
2004
ACM
104views ECommerce» more  SIGECOM 2004»
9 years 9 months ago
An economic answer to unsolicited communication
We explore an alternative approach to spam based on economic rather than technological or regulatory screening mechanisms. We employ a model of email value which supports two intu...
Thede Loder, Marshall W. van Alstyne, Rick Wash
SIGECOM
2004
ACM
100views ECommerce» more  SIGECOM 2004»
9 years 9 months ago
On approximately fair allocations of indivisible goods
Richard J. Lipton, Evangelos Markakis, Elchanan Mo...
SIGECOM
2004
ACM
105views ECommerce» more  SIGECOM 2004»
9 years 9 months ago
Mechanism design for online real-time scheduling
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
Ryan Porter
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
9 years 9 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman
SIGECOM
2004
ACM
93views ECommerce» more  SIGECOM 2004»
9 years 9 months ago
Strategic deliberation and truthful revelation: an impossibility result
In many market settings, agents do not know their preferences a priori. Instead, they may have to solve computationally complex optimization problems, query databases, or perform ...
Kate Larson, Tuomas Sandholm
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
9 years 9 months ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes
books