School for Advanced Studies in the Social Sciences

About: School for Advanced Studies in the Social Sciences is a facility organization based out in Villejuif, France. It is known for research contribution in the topics: Population & Politics. The organization has 1230 authors who have published 2084 publications receiving 57740 citations. The organization is also known as: Ecole des Hautes Etudes en Sciences Sociales & EHESS.

Distributed Domination on Graph Classes of Bounded Expansion

Abstract: oindent We provide a new constant factor approximation algorithm for the (connected) \mboxdistance- r dominating set problem on graph classes of bounded expansion. Classes of bounded expansion include many familiar classes of sparse graphs such as planar graphs and graphs with excluded (topological) minors, and notably, these classes form the most general subgraph closed classes of graphs for which a sequential constant factor approximation algorithm for the distance- r dominating set problem is currently known. Our algorithm can be implemented in the \congestbc model of distributed computing and uses $Oof(r^2 log n)$ communication rounds. % Our techniques, which may be of independent interest, are based on a distributed computation of sparse neighborhood covers of small radius on bounded expansion classes. We show how to compute an r -neighborhood cover of radius~$2r$ and overlap $f(r)$ on every class of bounded expansion in $Oof(r^2log n)$ communication rounds for some function~ f .% in the \congestbc model. % Finally, we show how to use the greater power of the local model to turn any distance- r dominating set into a constantly larger connected distance- r dominating set in $3r+1$ rounds on any class of bounded expansion. Combining this algorithm, e.g., with the constant factor approximation algorithm for dominating sets on planar graphs of Lenzen et al.\ gives a constant factor approximation algorithm for connected dominating sets on planar graphs in a constant number of rounds in the local model, where the approximation ratio is only $6$ times larger than that of Lenzen et al.'s algorithm.

Tessellation and Visibility Representations of Maps on the Torus

Abstract: The model of the torus as a parallelogram in the plane with opposite sides identified enables us to define two families of parallel lines and to tessellate the torus, then to associate to each tessellation a toroidal map with an upward drawing. It is proved that a toroidal map has a tessellation representation if and only if its universal cover is 2-connected. Those graphs that admit such an embedding in the torus are characterized.

Earned Wealth, Engaged Bidders? Evidence from a Second Price Auction

Abstract: This paper considers whether earned wealth affects bidding behavior in an induced-value second-price auction. We find people bid more sincerely in the auction with earned wealth given monetary incentives; earned wealth did not induce sincere bidding in hypothetical auctions.