Non-approximability results for optimization problems on bounded degree instances
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract
Eighteenth national conference on Artificial intelligence
Incentive compatible multi unit combinatorial auctions
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Truthful and Near-Optimal Mechanism Design via Linear Programming
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Optimal approximation for the submodular welfare problem in the value oracle model
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
Proceedings of the 9th ACM conference on Electronic commerce
eBay in the Sky: strategy-proof wireless spectrum auctions
Proceedings of the 14th ACM international conference on Mobile computing and networking
Two Randomized Mechanisms for Combinatorial Auctions
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
On the Hardness of Being Truthful
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Multiflows in multihop wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Maximum Independent Set of Links under Physical Interference Model
WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
On the Power of Randomization in Algorithmic Mechanism Design
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Online capacity maximization in wireless networks
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Mechanisms for multi-unit auctions
Journal of Artificial Intelligence Research
Distributed contention resolution in wireless networks
DISC'10 Proceedings of the 24th international conference on Distributed computing
Spectrum markets: motivation, challenges, and implications
IEEE Communications Magazine
Densest k-subgraph approximation on intersection graphs
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Approximation algorithms for secondary spectrum auctions
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
A truthful randomized mechanism for combinatorial public projects via convex optimization
Proceedings of the 12th ACM conference on Electronic commerce
From convex optimization to randomized mechanisms: toward optimal combinatorial auctions
Proceedings of the forty-third annual ACM symposium on Theory of computing
Limitations of Randomized Mechanisms for Combinatorial Auctions
FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
A universally-truthful approximation scheme for multi-unit auctions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Wireless capacity with oblivious power in general metrics
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Dynamic packet scheduling in wireless networks
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Brief announcement: universally truthful secondary spectrum auctions
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
| Hi-index | 0.00 |
We study truthful auctions for secondary spectrum usage in wireless networks. In this scenario, n communication requests need to be allocated to k available channels that are subject to interference and noise. We present the first truthful mechanisms for secondary spectrum auctions with symmetric or submodular valuations. Our approach to model interference uses an edge-weighted conflict graph, and our algorithms provide asymptotically almost optimal approximation bounds for conflict graphs with a small inductive independence number ρ n. This approach covers a large variety of interference models such as, e.g., the protocol model or the recently popular physical model of interference. For unweighted conflict graphs and symmetric valuations we use LP-rounding to obtain O(ρ)-approximate mechanisms; for weighted conflict graphs we get a factor of O(ρ ρ (log n + log k)). For submodular users we combine the convex rounding framework of [Dughmi et al. 2011] with randomized meta-rounding to obtain O(ρ)-approximate mechanisms for matroid-rank-sum valuations; for weighted conflict graphs we can fully drop the dependence on k to get O(ρ ρ log n). We conclude with promising initial results for deterministically truthful mechanisms that allow approximation factors based on ρ.