Sciweavers

1034 search results - page 22 / 207
» Competitive generalized auctions
Sort
View
SIGECOM
2009
ACM
132views ECommerce» more  SIGECOM 2009»
14 years 3 months ago
Limited and online supply and the bayesian foundations of prior-free mechanism design
We study auctions for selling a limited supply of a single commodity in the case where the supply is known in advance and the case it is unknown and must be instead allocated in a...
Nikhil R. Devanur, Jason D. Hartline
ATAL
2009
Springer
14 years 3 months ago
Pick-a-bundle: a novel bundling strategy for selling multiple items within online auctions
In this paper, we consider the design of an agent that is able to autonomously make optimal bundling decisions when selling multiple heterogeneous items within existing online auc...
Ioannis A. Vetsikas, Alex Rogers, Nicholas R. Jenn...
ICALP
2003
Springer
14 years 2 months ago
A Competitive Algorithm for the General 2-Server Problem
We consider the general on-line two server problem in which at each step both servers receive a request, which is a point in a metric space. One of the servers has to be moved to i...
René Sitters, Leen Stougie, Willem de Paepe
AIM
2005
13 years 9 months ago
General Game Playing: Overview of the AAAI Competition
A General Game Playing System is one that can accept a formal description of a game and play the game effectively without human intervention. Unlike specialized game players, such...
Michael R. Genesereth, Nathaniel Love, Barney Pell
LATIN
2004
Springer
14 years 2 months ago
On the Competitiveness of AIMD-TCP within a General Network
This paper presents a new mathematical model of AIMD (Additive Increase Multiplicative Decrease) TCP for general networks that we believe is better than those previously used when...
Jeff Edmonds