# Aranyak Mehta

According to our database

Collaborative distances:

^{1}, Aranyak Mehta authored at least 43 papers between 2000 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

Autobidding with Constraints.

Proceedings of the Web and Internet Economics - 15th International Conference, 2019

A new dog learns old tricks: RL finds classic optimization algorithms.

Proceedings of the 7th International Conference on Learning Representations, 2019

2018

Is Shapley cost sharing optimal?

Games Econ. Behav., 2018

Optimizing Ad Refresh In Mobile App Advertising.

Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

2015

Online Stochastic Matching with Unequal Probabilities.

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Biobjective Online Bipartite Matching.

Proceedings of the Web and Internet Economics - 10th International Conference, 2014

2013

Online Matching and Ad Allocation.

Foundations and Trends in Theoretical Computer Science, 2013

Optimizing budget constrained spend in search advertising.

Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, 2013

Designing Markets for Daily Deals.

Proceedings of the Web and Internet Economics - 9th International Conference, 2013

2012

Online Graph Edge-Coloring in the Random-Order Arrival Model.

Theory Comput., 2012

Online Matching with Stochastic Rewards.

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Pricing commodities.

Theor. Comput. Sci., 2011

Online bipartite matching with unknown distributions.

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Online Vertex-Weighted Bipartite Matching and Single-bid Budgeted Allocations.

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010

Design is as Easy as Optimization.

SIAM J. Discret. Math., 2010

A 1.43-Competitive Online Graph Edge Coloring Algorithm in the Random Order Arrival Model.

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009

A note on approximate Nash equilibria.

Theor. Comput. Sci., 2009

Beyond Moulin mechanisms.

Games Econ. Behav., 2009

On the Fourier spectrum of symmetric Boolean functions.

Combinatorica, 2009

Efficiency of (revenue-)optimal mechanisms.

Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Online Stochastic Matching: Beating 1-1/e.

Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, 2009

2008

Inapproximability Results for Combinatorial Auctions with Submodular Utility Functions.

Algorithmica, 2008

Online budgeted matching in random input models with applications to Adwords.

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Greedy List Intersection.

Proceedings of the 24th International Conference on Data Engineering, 2008

2007

An auction-based market equilibrium algorithm for a production model.

Theor. Comput. Sci., 2007

AdWords and generalized online matching.

J. ACM, 2007

Adwords Auctions with Decreasing Valuation Bids.

Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations.

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

Progress in approximate nash equilibria.

Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Some results on approximating the minimax solution in approval voting.

Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

2006

Posted price profit maximization for multicast by approximating fixed points.

J. Algorithms, 2006

2005

Caching with Expiration Times for Internet Applications.

Internet Math., 2005

On earthmover distance, metric labeling, and 0-extension

Electronic Colloquium on Computational Complexity (ECCC), 2005

A Simple Characterization for Truth-Revealing Single-Item Auctions.

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Fairness and optimality in congestion games.

Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

AdWords and Generalized On-line Matching.

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

On the Fourier Spectrum of Symmetric Boolean Functions with Applications to Learning Symmetric Juntas.

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004

Randomized truthful auctions of digital goods are randomizations over truthful auctions.

Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

2003

Profit-maximizing multicast pricing by approximating fixed points.

Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Playing large games using simple strategies.

Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003

Randomized Time-Space Tradeoffs for Directed Graph Connectivity.

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

2002

Caching with expiration times.

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2000

Keeping Track of the Latest Gossip in Shared Memory Systems.

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 2000