Sciweavers

602 search results - page 9 / 121
» Auctioning transformable goods
Sort
View
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
13 years 8 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
ICIS
2000
13 years 8 months ago
Economic mechanism design for securing online auctions
Enhancing e-commerce security through computing technology alone is not sufficient. E-commerce designers should apply economic mechanisms to design proper digital processes that a...
Wenli Wang, Zoltán Hidvégi, Andrew B...
EMNLP
2007
13 years 8 months ago
Finding Good Sequential Model Structures using Output Transformations
In Sequential Viterbi Models, such as HMMs, MEMMs, and Linear Chain CRFs, the type of patterns over output sequences that can be learned by the model depend directly on the modelâ...
Edward Loper
AAAI
2008
13 years 9 months ago
Bidding Strategies for Realistic Multi-Unit Sealed-Bid Auctions
When autonomous agents decide on their bidding strategies in real world auctions, they have a number of concerns that go beyond the models that are normally analyzed in traditiona...
Ioannis A. Vetsikas, Nicholas R. Jennings
UAI
2004
13 years 8 months ago
Bidding under Uncertainty: Theory and Experiments
This paper describes a study of agent bidding strategies, assuming combinatorial valuations for complementary and substitutable goods, in three auction environments: sequential au...
Amy R. Greenwald, Justin A. Boyan