Sciweavers

1429 search results - page 209 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
SIGECOM
2005
ACM
92views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
True costs of cheap labor are hard to measure: edge deletion and VCG payments in graphs
We address the problem of lowering the buyer’s expected payments in shortest path auctions, where the buyer’s goal is to purchase a path in a graph in which edges are owned by...
Edith Elkind
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
14 years 10 days ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang
ATAL
2008
Springer
13 years 9 months ago
Nonuniform bribery
We study the concept of bribery in the situation where voters are willing to change their votes as we ask them, but where their prices depend on the nature of the change we reques...
Piotr Faliszewski
AAAI
2004
13 years 9 months ago
SOFIA's Choice: An AI Approach to Scheduling Airborne Astronomy Observations
We describe an innovative solution to the problem of scheduling astronomy observations for the Stratospheric Observatory for Infrared Astronomy, an airborne observatory. The probl...
Jeremy Frank, Michael A. K. Gross, Elif Kürkl...
COR
2008
142views more  COR 2008»
13 years 7 months ago
Application of reinforcement learning to the game of Othello
Operations research and management science are often confronted with sequential decision making problems with large state spaces. Standard methods that are used for solving such c...
Nees Jan van Eck, Michiel C. van Wezel