3 search results - page 1 / 1 » Uniqueness of certain polynomials constant on a hyperplane |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
FOCS
2008
IEEE
13 years 4 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...