Bid expressiveness and clearing algorithms in multiattribute double auctions

@inproceedings{Engel2006BidEA,
  title={Bid expressiveness and clearing algorithms in multiattribute double auctions},
  author={Yagil Engel and Michael P. Wellman and Kevin M. Lochner},
  booktitle={EC},
  year={2006}
}
We investigate the space of two-sided multiattribute auctions, focusing on the relationship between constraints on the offers traders can express through bids, and the resulting computational problem of determining an optimal set of trades. We develop a formal semantic framework for characterizing expressible offers, and show conditions under which the allocation problem can be separated into first identifying optimal pairwise trades and subsequently optimizing combinations of those trades. We… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS
24 Citations
6 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Electronic call market trading

  • N. Economides, R. A. Schwartz
  • Journal of Portfolio Management , 21(3)
  • 1995
Highly Influential
4 Excerpts

Network Flows

  • R. K. Ahuja, T. L. Magnanti, J. B. Orlin
  • Prentice-Hall
  • 1993
Highly Influential
5 Excerpts

A multiplier adjustment method for the generalized assignment problem

  • M. L. Fisher, R. Jaikumar, L. N. Van Wassenhove
  • Management Science , 32(9):1095–1103
  • 1986
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…