Sciweavers

354 search results - page 44 / 71
» Approximate Option Pricing
Sort
View
ICML
2005
IEEE
16 years 3 months ago
Closed-form dual perturb and combine for tree-based models
This paper studies the aggregation of predictions made by tree-based models for several perturbed versions of the attribute vector of a test case. A closed-form approximation of t...
Pierre Geurts, Louis Wehenkel
TELETRAFFIC
2007
Springer
15 years 9 months ago
Network Capacity Allocation in Service Overlay Networks
We study the capacity allocation problem in service overlay networks (SON)s with state-dependent connection routing based on revenue maximization. We formulate the dimensioning pro...
Ngok Lam, Zbigniew Dziong, Lorne Mason
IPPS
2005
IEEE
15 years 8 months ago
Combinatorial Auction-Based Protocols for Resource Allocation in Grids
In this paper, we introduce the combinatorial auction model for resource management in grids. We propose a combinatorial auction-based resource allocation protocol in which a user...
Anubhav Das, Daniel Grosu
AAAI
2010
15 years 4 months ago
Stability and Incentive Compatibility in a Kernel-Based Combinatorial Auction
We present the design and analysis of an approximately incentive-compatible combinatorial auction. In just a single run, the auction is able to extract enough value information fr...
Sébastien Lahaie
WAOA
2010
Springer
239views Algorithms» more  WAOA 2010»
15 years 22 days ago
Strategic Multiway Cut and Multicut Games
We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential i...
Elliot Anshelevich, Bugra Caskurlu, Ameya Hate