Moshe Babaioff

According to our database1, Moshe Babaioff authored at least 64 papers between 2004 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2020
Escaping Cannibalization? Correlation-Robust Pricing for a Unit-Demand Buyer.
CoRR, 2020

Fair and Truthful Mechanisms for Dichotomous Valuations.
CoRR, 2020

Bulow-Klemperer-Style Results for Welfare Maximization in Two-Sided Markets.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Competitive Equilibrium with Generic Budgets: Beyond Additive.
CoRR, 2019

A New Approach to Fair Distribution of Welfare.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Fair Allocation through Competitive Equilibrium from Generic Incomes.
Proceedings of the Conference on Fairness, Accountability, and Transparency, 2019

Playing on a Level Field: Sincere and Sophisticated Players in the Boston Mechanism with a Coarse Priority Structure.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Matroid Secretary Problems.
J. ACM, 2018

Are Two (Samples) Really Better Than One? On the Non-Asymptotic Performance of Empirical Revenue Maximization.
CoRR, 2018

Incentives and Coordination in Bottleneck Models.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Optimal Deterministic Mechanisms for an Additive Buyer.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Are Two (Samples) Really Better Than One?
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Combinatorial Auctions with Endowment Effect.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

The Best of Both Worlds: Asymptotically Efficient Mechanisms with a Guarantee on the Expected Gains-From-Trade.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2017
Posting Prices with Unknown Distributions.
ACM Trans. Economics and Comput., 2017

Competitive Equilibria with Indivisible Goods and Generic Budgets.
CoRR, 2017

ERA: A Framework for Economic Resource Allocation for the Cloud.
Proceedings of the 26th International Conference on World Wide Web Companion, 2017

The menu-size complexity of revenue approximation.
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017

Submultiplicative Glivenko-Cantelli and Uniform Convergence of Revenues.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Selling Complementary Goods: Dynamics, Efficiency and Revenue.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Truthful Mechanisms for One-Parameter Agents.
Encyclopedia of Algorithms, 2016

Mechanism Design with Strategic Mediators.
ACM Trans. Economics and Comput., 2016

Networks of Complements.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Dynamic Pricing with Limited Supply.
ACM Trans. Economics and Comput., 2015

Truthful Mechanisms with Implicit Payment Computation.
J. ACM, 2015

Auctions with online supply.
Games Econ. Behav., 2015

Price Competition, Fluctuations and Welfare Guarantees.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014
A simple and approximately optimal mechanism for an additive buyer.
SIGecom Exch., 2014

Characterizing Truthful Multi-armed Bandit Mechanisms.
SIAM J. Comput., 2014

Price competition in online combinatorial markets.
Proceedings of the 23rd International World Wide Web Conference, 2014

Contract complexity.
Proceedings of the ACM Conference on Economics and Computation, 2014

On the efficiency of the walrasian mechanism.
Proceedings of the ACM Conference on Economics and Computation, 2014

2013
The communication burden of payment determination.
Games Econ. Behav., 2013

Bertrand networks.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Multi-parameter mechanisms with implicit payment computation.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Peaches, lemons, and cookies: designing auction markets with dispersed information.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012
Combinatorial agency.
J. Econ. Theory, 2012

Optimal mechanisms for selling information.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Sequential voting with externalities: herding in social networks.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

Combinatorial auctions with restricted complements.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011
On Bitcoin and red balloons.
SIGecom Exch., 2011

Only valuable experts can be valued.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010
Mixed Strategies in Combinatorial Agency.
J. Artif. Intell. Res., 2010

2009
Single-value combinatorial auctions and algorithmic implementation in undominated strategies.
J. ACM, 2009

Mechanisms for a spatially distributed market.
Games Econ. Behav., 2009

Congestion games with malicious players.
Games Econ. Behav., 2009

Secretary problems: weights and discounts.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Characterizing truthful multi-armed bandit mechanisms: extended abstract.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Selling ad campaigns: online algorithms with cancellations.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Free-Riding and Free-Labor in Combinatorial Agency.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

2008
Truthful Mechanisms for One-Parameter Agents.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Online auctions and generalized secretary problems.
SIGecom Exch., 2008

Computationally-feasible truthful auctions for convex bundles.
Games Econ. Behav., 2008

Informational overhead of incentive compatibility.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

On the Approximability of Combinatorial Exchange Problems.
Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007
Matroids, secretary problems, and online mechanisms.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On the Optimality and Interconnection of Valiant Load-Balancing Networks.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

A Knapsack Secretary Problem with Applications.
Proceedings of the Approximation, 2007

2006
Single-value combinatorial auctions and implementation in undominated strategies.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Combinatorial agency.
Proceedings of the Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), 2006

Impersonation-Based Mechanisms.
Proceedings of the Proceedings, 2006

2005
Incentive-compatible, budget-balanced, yet highly efficient auctions for supply chain formation.
Decis. Support Syst., 2005

Mechanism Design for Single-Value Domains.
Proceedings of the Proceedings, 2005

2004
Concurrent Auctions Across The Supply Chain.
J. Artif. Intell. Res., 2004


  Loading...