1034 search results - page 45 / 207 » Competitive generalized auctions |
ACRI
2006
Springer
15 years 6 months ago
2006
Springer
Abstract— We have recently shown that genetically programming game players, after having imbued the evolutionary process with human intelligence, produces human-competitive strat...
80
Voted
ESA
2004
Springer
15 years 5 months ago
2004
Springer
How efficiently can we search an unknown environment for a goal in unknown position? How much would it help if the environment were known? We answer these questions for simple poly...
139
click to vote
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
81
Voted
ECAI
2008
Springer
15 years 2 months ago
2008
Springer
In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid...
101
Voted
JAIR
2010
14 years 11 months ago
2010
We present an incentive-compatible polynomial-time approximation scheme for multiunit auctions with general k-minded player valuations. The mechanism fully optimizes over an appro...