The Power of Verification for Greedy Mechanism Design

Greedy algorithms are known to provide, in polynomial time, near optimal approximation guarantees for Combinatorial Auctions (CAs) with multidimensional bidders. It is known that truthful greedy-like mechanisms for CAs with multi-minded bidders do not achieve good approximation guarantees. In this work, we seek a deeper understanding of greedy mechanism design and investigate under which general assumptions, we can have efficient and truthful greedy mechanisms for CAs. Towards this goal, we use the framework of priority algorithms and weak and strong verification, where the bidders are not allowed to overbid on their winning set or on any subset of this set, respectively. We provide a complete characterization of the power of weak verification showing that it is sufficient and necessary for any greedy fixed priority algorithm to become truthful with the use of money or not, depending on the ordering of the bids. Moreover, we show that strong verification is sufficient and necessary to obtain a 2-approximate truthful mechanism with money, based on a known greedy algorithm, for the problem of submodular CAs in finite bidding domains. Our proof is based on an interesting structural analysis of the strongly connected components of the declaration graph

The Power of Verification for Greedy Mechanism Design

Greedy algorithms are known to provide near optimal approximation guarantees for Combinatorial Auctions (CAs) with multidimensional bidders, ignoring incentive compatibility. Borodin and Lucier [5] however proved that truthful greedy-like mechanisms for CAs with multi-minded bidders do not achieve good approximation guarantees. In this work, we seek a deeper understanding of greedy mechanism design and investigate under which general assumptions, we can have efficient and truthful greedy mechanisms for CAs. Towards this goal, we use the framework of priority algorithms and weak and strong verification, where the bidders are not allowed to overbid on their winning set or on any subsets of this set, respectively. We provide a complete characterization of the power of weak verification showing that it is sufficient and necessary for any greedy fixed priority algorithm to become truthful with the use of money or not, depending on the ordering of the bids. Moreover, we show that strong verification is sufficient and necessary for the greedy algorithm of [20], which is 2-approximate for submodular CAs, to become truthful with money in finite bidding domains. Our proof is based on an interesting structural analysis of the strongly connected components of the declaration graph

Dynamics of ripple formation on silicon surfaces by ultrashort laser pulses in sub-ablation conditions

An investigation of ultrashort pulsed laser induced surface modification due to conditions that result in a superheated melted liquid layer and material evaporation are considered. To describe the surface modification occurring after cooling and resolidification of the melted layer and understand the underlying physical fundamental mechanisms, a unified model is presented to account for crater and subwavelength ripple formation based on a synergy of electron excitation and capillary waves solidification. The proposed theoretical framework aims to address the laser-material interaction in sub-ablation conditions and thus minimal mass removal in combination with a hydrodynamics-based scenario of the crater creation and ripple formation following surface irradiation with single and multiple pulses, respectively. The development of the periodic structures is attributed to the interference of the incident wave with a surface plasmon wave. Details of the surface morphology attained are elaborated as a function of the imposed conditions and results are tested against experimental data

Making silicon hydrophobic: wettability control by two-lengthscale simultaneous patterning with femtosecond laser irradiation

We report on the wettability properties of silicon surfaces, simultaneously structured on the micrometre-scale and the nanometre-scale by femtosecond (fs) laser irradiation to render silicon hydrophobic. By varying the laser fluence, it was possible to control the wetting properties of a silicon surface through a systematic and reproducible variation of the surface roughness. In particular, the silicon–water contact angle could be increased from 66° to more than 130°. Such behaviour is described by incomplete liquid penetration within the silicon features, still leaving partially trapped air inside. We also show how controllable design and tailoring of the surface microstructures by wettability gradients can drive the motion of the drop's centre of mass towards a desired direction (even upwards)