Truthful mechanism design via correlated tree rounding (Q526848): Difference between revisions

@@ Property / DOI @@
-.1007/s10107-016-1068-5
@@ Property / DOI: 10.1007/s10107-016-1068-5 / rank @@
-Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B26
@@ Property / Mathematics Subject Classification ID: 91B26 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q25
@@ Property / Mathematics Subject Classification ID: 68Q25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6715574
@@ Property / zbMATH DE Number: 6715574 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+mechanism design
@@ Property / zbMATH Keywords: mechanism design / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+rounding
@@ Property / zbMATH Keywords: rounding / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial auctions
@@ Property / zbMATH Keywords: combinatorial auctions / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling mechanisms
@@ Property / zbMATH Keywords: scheduling mechanisms / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-016-1068-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2511680749
@@ Property / OpenAlex ID: W2511680749 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Lower Bounds for Anonymous Scheduling Mechanisms
+Normal rank
@@ Property / cites work @@
+Truthful approximation mechanisms for scheduling selfish related machines
+Normal rank
@@ Property / cites work @@
+Limitations of VCG-based mechanisms
@@ Property / cites work: Limitations of VCG-based mechanisms / rank @@
+Normal rank
@@ Property / cites work @@
+All-norm approximation algorithms
@@ Property / cites work: All-norm approximation algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3524720
@@ Property / cites work: Q3524720 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5417646
@@ Property / cites work: Q5417646 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
+Normal rank
@@ Property / cites work @@
+Truthful Generalized Assignments via Stable Matching
+Normal rank
@@ Property / cites work @@
+Mechanism design for fractional scheduling on unrelated machines
+Normal rank
@@ Property / cites work @@
+A lower bound for scheduling mechanisms
@@ Property / cites work: A lower bound for scheduling mechanisms / rank @@
+Normal rank
@@ Property / cites work @@
+A Deterministic Truthful PTAS for Scheduling Related Machines
+Normal rank
@@ Property / cites work @@
+Q3588651
@@ Property / cites work: Q3588651 / rank @@
+Normal rank
@@ Property / cites work @@
+Truthful Approximation Schemes for Single-Parameter Agents
+Normal rank
@@ Property / cites work @@
+On the Power of Randomization in Algorithmic Mechanism Design
+Normal rank
@@ Property / cites work @@
+Limitations of randomized mechanisms for combinatorial auctions
+Normal rank
@@ Property / cites work @@
+From query complexity to computational complexity
@@ Property / cites work: From query complexity to computational complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations
+Normal rank
@@ Property / cites work @@
+Tight Approximation Algorithms for Maximum Separable Assignment Problems
+Normal rank
@@ Property / cites work @@
+From convex optimization to randomized mechanisms
@@ Property / cites work: From convex optimization to randomized mechanisms / rank @@
+Normal rank
@@ Property / cites work @@
+A Unified Approach to Truthful Scheduling on Related Machines
+Normal rank
@@ Property / cites work @@
+A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
+Normal rank
@@ Property / cites work @@
+Inapproximability results for combinatorial auctions with submodular utility functions
+Normal rank
@@ Property / cites work @@
+A lower bound of \(1+\varphi \) for truthful scheduling mechanisms
+Normal rank
@@ Property / cites work @@
+Algorithms – ESA 2005
@@ Property / cites work: Algorithms – ESA 2005 / rank @@
+Normal rank
@@ Property / cites work @@
+Online Mechanism Design (Randomized Rounding on the Fly)
+Normal rank
@@ Property / cites work @@
+Truthful and Near-Optimal Mechanism Design via Linear Programming
+Normal rank
@@ Property / cites work @@
+Truth revelation in approximately efficient combinatorial auctions
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Q4910748
@@ Property / cites work: Q4910748 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic mechanism design
@@ Property / cites work: Algorithmic mechanism design / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+Least Majorized Elements and Generalized Polymatroids
+Normal rank
@@ Property / cites work @@
+Q3549686
@@ Property / cites work: Q3549686 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S10107-016-1068-5
@@ Property / DOI: 10.1007/S10107-016-1068-5 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:526848