1142 search results - page 51 / 229 » Approximability of Clausal Constraints |
160
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We exhibit incentive compatible multi-unit auctions that are not affine maximizers (i.e. are not of the VCG family) and yet approximate the social welfare to within a factor of 1 ...
164
click to vote
CP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
158
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
The fundamental operation of dominance testing, i.e., determining if one alternative is preferred to another, is in general very hard for methods of reasoning with qualitative cond...
158
click to vote
APJOR
2010
15 years 6 months ago
2010
In this paper we apply the well known sample average approximation (SAA) method to solve a class of stochastic variational inequality problems (SVIPs). We investigate the existenc...
150
click to vote
SIGECOM
2004
ACM
15 years 11 months ago
2004
ACM
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...