Truth Revelation in Approximately Efficient Combinatorial

@inproceedings{Lehmann2002TruthRI,
  title={Truth Revelation in Approximately Efficient Combinatorial},
  author={Daniel Lehmann},
  year={2002}
}
Some important classical mechanisms considered in Microeconomics and Game Theory require the solution of a difficult optimization problem. This is true of mechanisms for combinatorial auctions, which have in recent years assumed practical importance, and in particular of the gold standard for combinatorial auctions, the Generalized Vickrey Auction (GVA… CONTINUE READING