We consider the case of a digital product for share-averse bidders, where the product can be sold to multiple buyers who experience some disutility from other firms or consumers owning the same product. We model the problem of selling a digital product to share-averse bidders as an auction and apply a Bayesian optimal mechanism design. We also design constant-approximation algorithms in the prior-free setting including both average- and worst-case analyses.
- Constant-approximation algorithms
- Prior-free algorithms
- Share-averse bidders
ASJC Scopus subject areas
- Computer Science Applications
- Computer Networks and Communications
- Management of Technology and Innovation