2139 search results - page 213 / 428 » Complexity of Agents and Complexity of Markets |
170
click to vote
ACMICEC
2003
ACM
15 years 11 months ago
2003
ACM
This paper presents new clearing algorithms for multi-unit single-item and multi-unit combinatorial auctions with piecewise linear demand/supply functions. We analyse the complexi...
142
click to vote
IAT
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
181
click to vote
ICANNGA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we present application of genetic programming (GP) [1] to evolution of indirect encoding of neural network weights. We compare usage of original HyperNEAT algorithm w...
166
click to vote
IAT
2006
IEEE
16 years 17 days ago
2006
IEEE
Combinatorial Auctions (CAs), where users bid on combination of items, have emerged as a useful tool for resource allocation in distributed systems. However, two main difficulties...
157
click to vote
ATAL
2004
Springer
15 years 12 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...