Combinatorial auction design
By Aleksandar Sasa Pekec, Michael H. Rothkopf. Proceedings of the National Academy of Sciences of the United States of America, 2003
524 citations recorded by the source corpus.
Subfields: Economics and Econometrics, Management Science and Operations Research, Marketing
View Paper: https://www.semanticscholar.org/paper/936b57415128f1f576ada995468397b9570d9e86
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Economics and Econometrics
- John William Hatfield
- Richard F. Hartl
- Paul R. Milgrom
- Tayfun Sönmez
- Fuhito Kojima
- Alexander Westkamp
- Peter Cramton
- Yuichiro Kamada
In Management Science and Operations Research
- John William Hatfield
- Richard F. Hartl
- Paul R. Milgrom
- Tayfun Sönmez
- Fuhito Kojima
- Alexander Westkamp
- Peter Cramton
- Yuichiro Kamada
In Marketing
- John William Hatfield
- Paul R. Milgrom
- Tayfun Sönmez
- Alexander Westkamp
- Fuhito Kojima
- Peter Cramton
- Bettina Klaus
- Markus Walzl
Citations in the corpus
- The Clock-Proxy Auction: A Practical Combinatorial Auction Design (2004, unknown): “First, Porter et al. (2003) precede us in proposing a particular version of a “combinatorial” clock auction for spectrum auctions, and they provide experimental evidence in its support.”
- Combinatorial auctions (2007, unknown): “Some excellent surveys have recently discussed combinatorial auction design in general (Pekec̃ and Rothkopf 2003; de Vries and Vohra 2003), or highlighted a more specific issue (Xia et al.”
- Matching with Contracts (2005, background): “Dubins, Lester and Freedman, David.”
- Collaborative vehicle routing: A survey (2017, background): “In combinatorial auctions, requests are not traded individually but are combined to bundles (Pekeč and Rothkopf, 2003).”
- A Theory of Jump Bidding in Ascending Auctions (2004, background): “…in Ascending Auctions: Supplemental Tables Mark Isaac Florida State University Tim Salmon Florida State University Arthur Zillante Florida State University March 5, 2003 This appendix to the main paper contains some supplemental tables that were omitted from the main paper to conserve space.”
- Managing Online Auctions: Current Business and Research Issues (2003, background): “Pinker et al. (2000) model a firm that uses auctions to dispose of inventory. They use dynamic programming to determine the profit-maximizing way for a firm to allocate its inventory across multiple sequential auctions. They use a special case of (4) in which all the auctions are conducted with a no”