In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
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 ...
Sushil Bikhchandani, Sven de Vries, James Schummer...
Abstract. We present a useful new mechanism that facilitates the atomic exchange of many large baskets of securities in a combinatorial exchange. Cryptography prevents information ...
Preference elicitation — the process of asking queries to determine parties’ preferences — is a key part of many problems in electronic commerce. For example, a shopping age...
I develop a new mechanism for risk allocation and information speculation called a dynamic pari-mutuel market (DPM). A DPM acts as hybrid between a pari-mutuel market and a contin...