IOR
2011
13 years 2 months ago
2011
Consider selling bundles of indivisible goods to buyers with concave utilities that are additively separable in money and goods. We propose an ascending auction for the case when ...
CORR
2010
Springer
13 years 11 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...