Sciweavers

36 search results - page 2 / 8
» An Agent-Based Optimal Bidding Function
Sort
View
WWW
2008
ACM
14 years 6 months ago
Algorithm for stochastic multiple-choice knapsack problem and application to keywords bidding
We model budget-constrained keyword bidding in sponsored search auctions as a stochastic multiple-choice knapsack problem (S-MCKP) and design an algorithm to solve S-MCKP and the ...
Yunhong Zhou, Victor Naroditskiy
TMC
2008
192views more  TMC 2008»
13 years 5 months ago
A Bidding Algorithm for Optimized Utility-Based Resource Allocation in Ad Hoc Networks
Abstract-- This article proposes a scheme for bandwidth allocation in wireless ad hoc networks. The quality of service (QoS) levels for each end-to-end flow are expressed using a r...
Calin Curescu, Simin Nadjm-Tehrani
AWIC
2003
Springer
13 years 11 months ago
Secure Intelligent Agents Based on Formal Description Techniques
This paper describes a practical solution for the incorporation of security services in agents. From a set of basic user requirements, the agents will be able to find out the best ...
L. Mengual, C. de la Puente
WIAS
2008
85views more  WIAS 2008»
13 years 5 months ago
Optimal combinatorial electricity markets
The deregulation of the electricity industry in many countries has created a number of marketplaces in which producers and consumers can operate in order to more effectively manage...
Yoseba K. Penya, Nicholas R. Jennings
AAAI
2004
13 years 7 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