A lower bound on seller revenue in single buyer monopoly auctions.
Omer TamuzPublished in: Oper. Res. Lett. (2013)
Keyphrases
- lower bound
- auction mechanisms
- electronic commerce
- mechanism design
- upper bound
- sealed bid
- online auctions
- social welfare
- transaction costs
- group buying
- dynamic pricing
- reverse auction
- branch and bound
- np hard
- third party
- branch and bound algorithm
- multi attribute
- objective function
- lower and upper bounds
- worst case
- electronic markets
- multi agent systems