Aranyak Mehta

Orcid: 0000-0002-6132-4901

According to our database1, Aranyak Mehta authored at least 66 papers between 2000 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Auto-Bidding and Auctions in Online Advertising: A Survey.
SIGecom Exch., 2024

Linear Transformer Topological Masking with Graph Random Features.
CoRR, 2024

Conditioned Language Policy: A General Framework for Steerable Multi-Objective Finetuning.
CoRR, 2024

Deep Reinforcement Learning for Sequential Combinatorial Auctions.
CoRR, 2024

Auctions with Dynamic Scoring.
CoRR, 2024

Efficiency of Non-Truthful Auctions in Auto-bidding with Budget Constraints.
Proceedings of the ACM on Web Conference 2024, 2024

User Response in Ad Auctions: An MDP Formulation of Long-term Revenue Optimization.
Proceedings of the ACM on Web Conference 2024, 2024

The Power of Two-Sided Recruitment in Two-Sided Markets.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Prior-Independent Auctions for Heterogeneous Bidders.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Auctions with LLM Summaries.
Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2024

Conditional Language Policy: A General Framework For Steerable Multi-Objective Finetuning.
Proceedings of the Findings of the Association for Computational Linguistics: EMNLP 2024, 2024

The Average-Value Allocation Problem.
Proceedings of the Approximation, 2024

2023
Reward Selection with Noisy Observations.
CoRR, 2023

User Response in Ad Auctions: An MDP Formulation of Long-Term Revenue Optimization.
CoRR, 2023

Auctions without commitment in the auto-bidding world.
Proceedings of the ACM Web Conference 2023, 2023

Efficiency of Non-Truthful Auctions in Auto-bidding: The Power of Randomization.
Proceedings of the ACM Web Conference 2023, 2023

Incentive Compatibility in the Auto-bidding World.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Efficiency of non-truthful auctions under auto-bidding.
CoRR, 2022

Auction Design in an Auto-bidding Setting: Randomization Improves Efficiency Beyond VCG.
Proceedings of the WWW '22: The ACM Web Conference 2022, Virtual Event, Lyon, France, April 25, 2022

Simple Mechanisms for Welfare Maximization in Rich Advertising Auctions.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Convergence Analysis of No-Regret Bidding Algorithms in Repeated Auctions.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Learning Robust Algorithms for Online Allocation Problems Using Adversarial Training.
CoRR, 2020

Hitting the High Notes: Subset Selection for Maximizing Expected Order Statistics.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

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.
Found. Trends Theor. Comput. Sci., 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

On Earthmover Distance, Metric Labeling, and 0-Extension.
SIAM J. Comput., 2009

Beyond Moulin mechanisms.
Games Econ. Behav., 2009

On the Fourier spectrum of symmetric Boolean functions.
Comb., 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

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


  Loading...