Aranyak Mehta

From MaRDI portal
Person:627115

Available identifiers

zbMath Open mehta.aranyakMaRDI QIDQ627115

List of research outcomes





PublicationDate of PublicationType
Prior-independent auctions for heterogeneous bidders2024-11-28Paper
Autobidding with constraints2020-06-30Paper
Is Shapley cost sharing optimal?2018-07-12Paper
Online stochastic matching with unequal probabilities2017-10-05Paper
Online vertex-weighted bipartite matching and single-bid budgeted allocations2017-09-29Paper
Designing markets for daily deals2015-01-12Paper
Biobjective online bipartite matching2015-01-07Paper
On earthmover distance, metric labeling, and 0-extension2014-11-25Paper
Online graph edge-coloring in the random-order arrival model2014-10-06Paper
Online bipartite matching with unknown distributions2014-06-05Paper
A 1.43-competitive online graph edge coloring algorithm in the random order arrival model2014-05-22Paper
Online matching and ad allocation2014-01-15Paper
Design is as easy as optimization2011-03-15Paper
Pricing commodities2011-02-21Paper
On the Fourier spectrum of symmetric Boolean functions2010-08-13Paper
https://portal.mardi4nfdi.de/entity/Q35794202010-08-06Paper
On earthmover distance, metric labeling, and 0-extension2010-04-29Paper
Beyond Moulin mechanisms2009-08-27Paper
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science2009-08-06Paper
A note on approximate Nash equilibria2009-04-29Paper
Design Is as Easy as Optimization2009-03-12Paper
AdWords and generalized online matching2008-12-21Paper
Inapproximability results for combinatorial auctions with submodular utility functions2008-09-12Paper
Is Shapley Cost Sharing Optimal?2008-05-02Paper
Adwords Auctions with Decreasing Valuation Bids2008-04-15Paper
Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations2008-02-20Paper
An auction-based market equilibrium algorithm for a production model2007-06-13Paper
Caching with Expiration Times for Internet Applications2006-05-09Paper
Posted price profit maximization for multicast by approximating fixed points2006-04-28Paper
Learning symmetric k-juntas in time n^o(k)2005-04-12Paper
https://portal.mardi4nfdi.de/entity/Q48289812004-11-29Paper

Research outcomes over time

This page was built for person: Aranyak Mehta