Sciweavers

187 search results - page 9 / 38
» Optimal strategies in sequential bidding
Sort
View
GECCO
2009
Springer
150views Optimization» more  GECCO 2009»
14 years 7 months ago
Parallel shared memory strategies for ant-based optimization algorithms
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the ma...
Thang Nguyen Bui, ThanhVu H. Nguyen, Joseph R. Riz...
SIGECOM
2008
ACM
158views ECommerce» more  SIGECOM 2008»
14 years 9 months ago
Information revelation and random entry in sequential ascending auctions
We examine a model in which multiple buyers with single-unit demand are faced with an infinite sequence of auctions. New buyers arrive on the market probabilistically, and are each...
Maher Said
SIAMCO
2008
70views more  SIAMCO 2008»
14 years 9 months ago
Minimal Time Sequential Batch Reactors with Bounded and Impulse Controls for One or More Species
We consider the optimal control problem of feeding in minimal time a tank where several species compete for a single resource, with the objective being to reach a given level of th...
Pedro Gajardo, Héctor Ramírez Cabrer...
WSC
2008
15 years 9 hour ago
Randomized methods for solving the Winner Determination Problem in combinatorial auctions
Combinatorial auctions, where buyers can bid on bundles of items rather than bidding them sequentially, often lead to more economically efficient allocations of financial resource...
Joshua C. C. Chan, Dirk P. Kroese
IAT
2007
IEEE
15 years 4 months ago
Multi-Period Combinatorial Auction Mechanism for Distributed Resource Allocation and Scheduling
We consider the problem of resource allocation and scheduling where information and decisions are decentralized, and our goal is to propose a market mechanism that allows resource...
Hoong Chuin Lau, Shih-Fen Cheng, Thin Yin Leong, J...