24 citations · 43 across the 16 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.GT2013★ 3 cited
Proving soundness of combinatorial Vickrey auctions and generating verified executable code
Marco B. Caminati, Manfred Kerber, Christoph Lange +1
Using mechanised reasoning we prove that combinatorial Vickrey auctions are soundly specified in that they associate a unique outcome (allocation and transfers) to any valid input…
cs.LO2013★ 2 cited
A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory
Christoph Lange, Marco B. Caminati, Manfred Kerber +4
Novel auction schemes are constantly being designed. Their design has significant consequences for the allocation of goods and the revenues generated. But how to tell whether a new…