1034 search results - page 69 / 207 » Competitive generalized auctions |
111
click to vote
AAAI
2008
15 years 2 months ago
2008
The aim of General Game Playing (GGP) is to create intelligent agents that automatically learn how to play many different games at an expert level without any human intervention. ...
101
Voted
KDD
1999
ACM
15 years 4 months ago
1999
ACM
Tree Augmented Naive Bayes (TAN) has shown to be competitive with state-of-the-art machine learning algorithms [3]. However, the TAN induction algorithm that appears in [3] can be...
91
Voted
WPES
2005
ACM
15 years 6 months ago
2005
ACM
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...
101
Voted
SIGECOM
2009
ACM
15 years 7 months ago
2009
ACM
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
183
click to vote
EPS
1998
Springer
15 years 4 months ago
1998
Springer
We investigate the following question. Do populations of evolving agents adapt only to their recent environment or do general adaptive features appear over time? We find statistica...