Sciweavers

275 search results - page 7 / 55
» On the computational power of iterative auctions
Sort
View
ATAL
2004
Springer
15 years 3 months ago
A Study of Limited-Precision, Incremental Elicitation in Auctions
We investigate the design of iterative, limited-precision mechanisms for single-good auctions with dominant strategy equilibria. Our aim is to design mechanisms that minimize the ...
Alexander Kress, Craig Boutilier
PDP
2005
IEEE
15 years 3 months ago
Some Solutions for Peer-to-Peer Global Computing
the emergence of Internet and new kind of architecture, likepeer-to-peer (P2P) networks, provides great hope for distributed computation. However, the combination of the world of ...
Guillaume Jourjon, Didier El Baz
HICSS
2007
IEEE
136views Biometrics» more  HICSS 2007»
15 years 4 months ago
Analog and Hybrid Computation Approaches for Static Power Flow
Analog and hybrid computation methods are areas of continued interest, particularly in specific applications where traditional digital computation techniques cannot achieve the de...
Aaron St. Leger, Chika O. Nwankpa
ATAL
2009
Springer
15 years 4 months ago
Stronger CDA strategies through empirical game-theoretic analysis and reinforcement learning
We present a general methodology to automate the search for equilibrium strategies in games derived from computational experimentation. Our approach interleaves empirical game-the...
L. Julian Schvartzman, Michael P. Wellman
AAAI
2004
14 years 11 months ago
Eliciting Bid Taker Non-price Preferences in (Combinatorial) Auctions
Recent algorithms provide powerful solutions to the problem of determining cost-minimizing (or revenue-maximizing) allocations of items in combinatorial auctions. However, in many...
Craig Boutilier, Tuomas Sandholm, Rob Shields