Sciweavers

3433 search results - page 141 / 687
» Heuristics for a bidding problem
Sort
View
WINE
2010
Springer
164views Economy» more  WINE 2010»
15 years 4 months ago
Incentives in Online Auctions via Linear Programming
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
Niv Buchbinder, Kamal Jain, Mohit Singh
WINE
2009
Springer
194views Economy» more  WINE 2009»
16 years 1 months ago
Mechanism Design for Complexity-Constrained Bidders
A well-known result due to Vickery gives a mechanism for selling a number of goods to interested buyers in a way that achieves the maximum social welfare. In practice, a problem wi...
Ravi Kumar, Mohammad Mahdian, Amin Sayedi
ADBIS
2000
Springer
82views Database» more  ADBIS 2000»
15 years 11 months ago
A New Algorithm for Page Access Sequencing in Join Processing
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
Andrew Lim, Wee-Chong Oon, Chi-Hung Chi
IJAIT
2002
81views more  IJAIT 2002»
15 years 6 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos
IAT
2006
IEEE
16 years 17 days ago
Strategic Issues in Trading Agent Competition: TAC-Classic
With the advancement of Internet Technology, increasing number of electronic marketplaces and online auction houses provides real-time transaction services for buyers and sellers ...
Francisco Oliveira, Yain-Whar Si