71 search results - page 5 / 15 » focs 2009 |
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— We study a simple game theoretic model for the spread of an innovation in a network. The diffusion of the innovation is modeled as the dynamics of a coordination game in which ...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis-aligned query box can be reported efficiently. T...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
— Bargaining games on exchange networks have been studied by both economists and sociologists. A Balanced Outcome [9], [15] for such a game is an equilibrium concept that combine...