50 search results - page 8 / 10 » Random knapsack in expected polynomial time |
ESA
2007
Springer
14 years 1 months ago
2007
Springer
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
SODA
2001
ACM
13 years 11 months ago
2001
ACM
In the bus network problem, the goal is to generate a plan for getting from point X to point Y within a city using buses in the smallest expected time. Because bus arrival times a...
SAGT
2009
Springer
14 years 4 months ago
2009
Springer
Let A be a randomized, unlimited supply, unit demand, single-item auction, which given a bid-vector b ∈ [h]n , has expected profit E[P(b)]. Aggarwal et al. showed that given A, ...
ANTSW
2010
Springer
13 years 7 months ago
2010
Springer
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
BIRTHDAY
2009
Springer
14 years 4 months ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...