Sciweavers

243 search results - page 24 / 49
» On Optimal Single-Item Auctions
Sort
View
MAGS
2010
153views more  MAGS 2010»
13 years 2 months ago
Designing bidding strategies in sequential auctions for risk averse agents
Designing efficient bidding strategies for sequential auctions remains an important, open problem area in agent-mediated electronic markets. In existing literature, a variety of bi...
Valentin Robu, Han La Poutré
FOCS
2008
IEEE
13 years 8 months ago
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
Deeparnab Chakrabarty, Gagan Goel
WSC
2008
13 years 9 months 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
ICTAI
2005
IEEE
14 years 1 months ago
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing T...
GECCO
1999
Springer
111views Optimization» more  GECCO 1999»
13 years 11 months ago
On using ZCS in a Simulated Continuous Double-Auction Market
This paper presents results from on-going investigations into the performance of the Michiganstyle classifier system in a complex multi-agent environment. Using a simplified model...
Larry Bull