Shahar Dobzinski
From MaRDI portal
Person:414843
List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Rigidity in mechanism design and its applications | 2024-09-25 | Paper |
| scientific article; zbMATH DE number 7829287 (Why is no real title available?) | 2024-04-09 | Paper |
| Combinatorial reallocation mechanisms Algorithmica | 2024-04-02 | Paper |
| On the hardness of dominant strategy mechanism design Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| The communication complexity of payment computation Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
| Combinatorial auctions with endowment effect Games and Economic Behavior | 2022-11-24 | Paper |
| (Almost) efficient mechanisms for bilateral trading Games and Economic Behavior | 2021-11-24 | Paper |
| Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders SIAM Journal on Computing | 2021-06-29 | Paper |
| The communication complexity of local search Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
| Economic efficiency requires interaction Games and Economic Behavior | 2019-12-12 | Paper |
| Optimization with demand oracles Algorithmica | 2019-05-17 | Paper |
| Communication complexity of combinatorial auctions with submodular valuations Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
| Sketching valuation functions | 2019-05-10 | Paper |
| Faster and simpler sketches of valuation functions ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations Journal of the ACM | 2018-08-02 | Paper |
| Is Shapley cost sharing optimal? Games and Economic Behavior | 2018-07-12 | Paper |
| On the complexity of computing an equilibrium in combinatorial auctions Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
| Breaking the logarithmic barrier for truthful combinatorial auctions with submodular bidders Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
| Welfare and revenue guarantees for competitive bundling equilibrium Web and Internet Economics | 2016-01-08 | Paper |
| Approximately optimal auctions for correlated bidders Games and Economic Behavior | 2015-08-12 | Paper |
| Economic efficiency requires interaction Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
| Multi-unit auctions: beyond Roberts Journal of Economic Theory | 2015-02-13 | Paper |
| Shared resource management via reward schemes Algorithmic Game Theory | 2015-01-14 | Paper |
| Truthful randomized mechanisms for combinatorial auctions Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
| On the Power of Randomization in Algorithmic Mechanism Design 2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
| Efficiency Guarantees in Auctions with Budgets Automata, Languages, and Programming | 2014-07-01 | Paper |
| Limitations of VCG-based mechanisms Combinatorica | 2014-06-13 | Paper |
| An impossibility result for truthful combinatorial auctions with submodular valuations Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| Optimal auctions with correlated bidders are easy Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
| From query complexity to computational complexity Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
| On the power of randomization in algorithmic mechanism design SIAM Journal on Computing | 2014-04-11 | Paper |
| Optimal lower bounds for anonymous scheduling mechanisms Mathematics of Operations Research | 2012-05-24 | Paper |
| Truthful randomized mechanisms for combinatorial auctions Journal of Computer and System Sciences | 2012-05-11 | Paper |
| Multi-unit auctions with budget limits Games and Economic Behavior | 2012-03-19 | Paper |
| Truthful approximation schemes for single-parameter agents SIAM Journal on Computing | 2011-10-18 | Paper |
| Approximation algorithms for combinatorial auctions with complement-free bidders Mathematics of Operations Research | 2011-04-27 | Paper |
| An improved approximation algorithm for combinatorial auctions with submodular bidders Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
| Approximation algorithms for combinatorial auctions with complement-free bidders Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| Mechanisms for multi-unit auctions Journal of Artificial Intelligence Research | 2010-03-15 | Paper |
| A modular approach to Roberts' theorem Algorithmic Game Theory | 2009-12-01 | Paper |
| Two Randomized Mechanisms for Combinatorial Auctions Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2009-02-17 | Paper |
| Limitations of VCG-based mechanisms | 2009-01-05 | Paper |
| Prompt Mechanisms for Online Auctions Algorithmic Game Theory | 2008-05-02 | Paper |
| Is Shapley Cost Sharing Optimal? Algorithmic Game Theory | 2008-05-02 | Paper |
Research outcomes over time
This page was built for person: Shahar Dobzinski
