An optimal algorithm for on-line bipartite matching
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
An investigation into sources of network externalities in the packaged PC software market
Information Economics and Policy
On Some Tighter Inapproximability Results (Extended Abstract)
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Maximizing Non-Monotone Submodular Functions
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Stochastic analyses for online combinatorial optimization problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal marketing strategies over social networks
Proceedings of the 17th international conference on World Wide Web
Set Covering with our Eyes Closed
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
A Cascade Model for Externalities in Sponsored Search
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Sponsored Search Auctions with Markovian Users
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
On the Equilibria and Efficiency of the GSP Mechanism in Keyword Auctions with Externalities
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Externalities in Keyword Auctions: An Empirical and Theoretical Assessment
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Online Stochastic Matching: Beating 1-1/e
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Optimal pricing in the presence of local network effects
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Optimal iterative pricing over social networks
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Equilibrium pricing with positive externalities
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Online bipartite matching with unknown distributions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Submodular maximization by simulated annealing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online stochastic matching: online actions based on offline statistics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
We consider the problem of designing auctions in social networks for goods that exhibit single-parameter submodular network externalities in which a bidder’s value for an outcome is a fixed private type times a known submodular function of the allocation of his friends. Externalities pose many issues that are hard to address with traditional techniques; our work shows how to resolve these issues in a specific setting of particular interest. We operate in a Bayesian environment and so assume private values are drawn according to known distributions. We prove that the optimal auction is NP-hard to approximate pointwise, and APX-hard on average. Thus we instead design auctions whose revenue approximates that of the optimal auction. Our main result considers step-function externalities in which a bidder’s value for an outcome is either zero, or equal to his private type if at least one friend has the good. For these settings, we provide a e/e + 1-approximation. We also give a 0.25-approximation auction for general single-parameter submodular network externalities, and discuss optimizing over a class of simple pricing strategies.