Sciweavers

3433 search results - page 51 / 687
» Heuristics for a bidding problem
Sort
View
SIGECOM
2003
ACM
124views ECommerce» more  SIGECOM 2003»
14 years 28 days ago
Coalitional games on graphs: core structure, substitutes and frugality
We study mechanisms that can be modelled as coalitional games with transferable utilities, and apply ideas from mechanism design and game theory to problems arising in a network d...
Rahul Garg, Vijay Kumar, Atri Rudra, Akshat Verma
WINE
2010
Springer
168views Economy» more  WINE 2010»
13 years 5 months ago
On the Competitive Ratio of Online Sampling Auctions
We study online profit-maximizing auctions for digital goods with adversarial bid selection and uniformly random arrivals. Our goal is to design auctions that are constant competit...
Elias Koutsoupias, George Pierrakos
CDC
2010
IEEE
13 years 2 months ago
Market-based control mechanisms for electric power demand response
We propose a settlement mechanism for optimally scheduling real time electricity consumption which is suitable for an automated demand response control system. Our proposed settlem...
Anthony Papavasiliou, Haitham Hindi, Daniel Greene
TON
2002
83views more  TON 2002»
13 years 7 months ago
Heuristic algorithms for multiconstrained quality-of-service routing
Multiconstrained quality-of-service (QoS) routing deals with finding routes that satisfy multiple independent QoS constraints. This problem is NP-hard. In this paper, two heuristic...
Xin Yuan
EOR
2006
118views more  EOR 2006»
13 years 7 months ago
A random-key genetic algorithm for the generalized traveling salesman problem
The Generalized Traveling Salesman Problem is a variation of the well known Traveling Salesman Problem in which the set of nodes is divided into clusters; the objective is to find...
Lawrence V. Snyder, Mark S. Daskin