Shahar Dobzinski

Available identifiers

zbMath Open dobzinski.shaharMaRDI QIDQ414843

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q6126288	2024-04-09	Paper
Combinatorial reallocation mechanisms	2024-04-02	Paper
On the hardness of dominant strategy mechanism design	2023-12-08	Paper
The communication complexity of payment computation	2023-11-14	Paper
Combinatorial auctions with endowment effect	2022-11-24	Paper
(Almost) efficient mechanisms for bilateral trading	2021-11-24	Paper
Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders	2021-06-29	Paper
The communication complexity of local search	2020-01-30	Paper
Economic efficiency requires interaction	2019-12-12	Paper
Optimization with demand oracles	2019-05-17	Paper
Communication Complexity of Combinatorial Auctions with Submodular Valuations	2019-05-15	Paper
https://portal.mardi4nfdi.de/entity/Q5743455	2019-05-10	Paper
Faster and Simpler Sketches of Valuation Functions	2018-11-05	Paper
Impossibility Results for Truthful Combinatorial Auctions with Submodular Valuations	2018-08-02	Paper
Is Shapley cost sharing optimal?	2018-07-12	Paper
On the Complexity of Computing an Equilibrium in Combinatorial Auctions	2017-10-05	Paper
Breaking the Logarithmic Barrier for Truthful Combinatorial Auctions with Submodular Bidders	2017-09-29	Paper
Welfare and Revenue Guarantees for Competitive Bundling Equilibrium	2016-01-08	Paper
Approximately optimal auctions for correlated bidders	2015-08-12	Paper
Economic efficiency requires interaction	2015-06-26	Paper
Multi-unit auctions: beyond Roberts	2015-02-13	Paper
Shared Resource Management via Reward Schemes	2015-01-14	Paper
Truthful randomized mechanisms for combinatorial auctions	2014-11-25	Paper
On the Power of Randomization in Algorithmic Mechanism Design	2014-07-25	Paper
Efficiency Guarantees in Auctions with Budgets	2014-07-01	Paper
Limitations of VCG-based mechanisms	2014-06-13	Paper
Optimal auctions with correlated bidders are easy	2014-06-05	Paper
An impossibility result for truthful combinatorial auctions with submodular valuations	2014-06-05	Paper
From query complexity to computational complexity	2014-05-13	Paper
On the Power of Randomization in Algorithmic Mechanism Design	2014-04-11	Paper
Optimal Lower Bounds for Anonymous Scheduling Mechanisms	2012-05-24	Paper
Truthful randomized mechanisms for combinatorial auctions	2012-05-11	Paper
Multi-unit auctions with budget limits	2012-03-19	Paper
Truthful Approximation Schemes for Single-Parameter Agents	2011-10-18	Paper
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders	2011-04-27	Paper
Approximation algorithms for combinatorial auctions with complement-free bidders	2010-08-16	Paper
An improved approximation algorithm for combinatorial auctions with submodular bidders	2010-08-16	Paper
Mechanisms for Multi-Unit Auctions	2010-03-15	Paper
A Modular Approach to Roberts’ Theorem	2009-12-01	Paper
Two Randomized Mechanisms for Combinatorial Auctions	2009-02-17	Paper
https://portal.mardi4nfdi.de/entity/Q3549630	2009-01-05	Paper
Prompt Mechanisms for Online Auctions	2008-05-02	Paper
Is Shapley Cost Sharing Optimal?	2008-05-02	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Shahar Dobzinski