Amin Saberi

Tristan Pollner

Math. Oper. Res., 2024

Technical Note - Near-Optimal Bayesian Online Assortment of Reusable Resources.

[BibT_eX]

[DOI]

Oper. Res., 2024

Two-Stage Stochastic Matching and Pricing with Applications to Ride Hailing.

[BibT_eX]

[DOI]

Oper. Res., 2024

CHASE-SQL: Multi-Path Reasoning and Preference Optimized Candidate Selection in Text-to-SQL.

[BibT_eX]

[DOI]

Mohammadreza Pourreza

CoRR, 2024

New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling.

[BibT_eX]

[DOI]

CoRR, 2024

Stochastic Online Metric Matching: Adversarial is no Harder than Stochastic.

[BibT_eX]

[DOI]

Mingwei Yang

Sophie H. Yu

CoRR, 2024

CHESS: Contextual Harnessing for Efficient SQL Synthesis.

[BibT_eX]

[DOI]

Shayan Talaei

Mohammadreza Pourreza

Yu-Chen Chang

Azalia Mirhoseini

CoRR, 2024

Statistical Guarantees for Link Prediction using Graph Neural Networks.

[BibT_eX]

[DOI]

Alan Chung

Morgane Austern

CoRR, 2024

Approximating Optimum Online for Capacitated Resource Allocation.

[BibT_eX]

[DOI]

Proceedings of the 25th ACM Conference on Economics and Computation, 2024

MAGNOLIA: Matching Algorithms via GNNs for Online Value-to-go Approximation.

[BibT_eX]

[DOI]

Proceedings of the Forty-first International Conference on Machine Learning, 2024

Locality-Aware Graph Rewiring in GNNs.

[BibT_eX]

[DOI]

Francesco Di Giovanni

Proceedings of the Twelfth International Conference on Learning Representations, 2024

Sublinear Algorithms for TSP via Path Covers.

[BibT_eX]

[DOI]

Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting.

[BibT_eX]

[DOI]

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Sequential Submodular Maximization and Applications to Ranking an Assortment of Products.

[BibT_eX]

[DOI]

Oper. Res., July, 2023

Edge-Weighted Online Windowed Matching.

[BibT_eX]

[DOI]

Math. Oper. Res., May, 2023

A Local Graph Limits Perspective on Sampling-Based GNNs.

[BibT_eX]

[DOI]

Yeganeh Alimohammadi

Luana Ruiz

CoRR, 2023

Beating Greedy Matching in Sublinear Time.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Technical Note - Online Hypergraph Matching with Delays.

[BibT_eX]

[DOI]

Oper. Res., 2022

Algorithms Using Local Graph Features to Predict Epidemics.

[BibT_eX]

[DOI]

Yeganeh Alimohammadi

Christian Borgs

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

The Stationary Prophet Inequality Problem.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Near-Optimal Bayesian Online Assortment of Reusable Resources.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

The Value of Excess Supply in Spatial Matching Markets.

[BibT_eX]

[DOI]

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

Beating the Folklore Algorithm for Dynamic Matching.

[BibT_eX]

[DOI]

Mohammad Roghani

Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021

Sequential importance sampling for estimating expectations over the space of perfect matchings.

[BibT_eX]

[DOI]

CoRR, 2021

The Greedy Algorithm is \emph{not} Optimal for On-Line Edge Coloring.

[BibT_eX]

[DOI]

CoRR, 2021

Locality of Random Digraphs on Expanders.

[BibT_eX]

[DOI]

Yeganeh Alimohammadi

Christian Borgs

CoRR, 2021

Two-stage Stochastic Matching with Application to Ride Hailing.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Decentralized Matching in a Probabilistic Environment.

[BibT_eX]

[DOI]

Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Tiered Random Matching Markets: Rank Is Proportional to Popularity.

[BibT_eX]

[DOI]

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Sampling Arborescences in Parallel.

[BibT_eX]

[DOI]

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

The Greedy Algorithm Is not Optimal for On-Line Edge Coloring.

[BibT_eX]

[DOI]

Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021

2020

Assignment Mechanisms Under Distributional Constraints.

[BibT_eX]

[DOI]

Itai Ashlagi

Ali Shameli

Oper. Res., 2020

Ranking an Assortment of Products via Sequential Submodular Optimization.

[BibT_eX]

[DOI]

CoRR, 2020

Online Hypergraph Matching with Delays.

[BibT_eX]

[DOI]

Proceedings of the Web and Internet Economics - 16th International Conference, 2020

Queue Lengths as Constantly Adapting Prices: Allocative Efficiency Under Random Dynamics.

[BibT_eX]

[DOI]

Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

2019

Competition in Ride-Hailing Markets.

[BibT_eX]

[DOI]

AmirMahdi Ahmadinejad

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

Perron-Frobenius Theory in Nearly Linear Time: Positive Eigenvectors, M-matrices, Graph Kernels, and Other Applications.

[BibT_eX]

[DOI]

AmirMahdi Ahmadinejad

Arun Jambulapati

Aaron Sidford

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection.

[BibT_eX]

[DOI]

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Generating Random Networks Without Short Cycles.

[BibT_eX]

[DOI]

Mohsen Bayati

Oper. Res., 2018

Maximum Weight Online Matching with Deadlines.

[BibT_eX]

[DOI]

CoRR, 2018

Maximizing Efficiency in Dynamic Matching Markets.

[BibT_eX]

[DOI]

CoRR, 2018

Creating Crowdsourced Research Talks at Scale.

[BibT_eX]

[DOI]

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

Prophet Inequalities vs. Approximating Optimum Online.

[BibT_eX]

[DOI]

Ali Shameli

Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Approximating the Largest Root and Applications to Interlacing Families.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Diffusion, Seeding, and the Value of Network Information.

[BibT_eX]

[DOI]

Mohammad Akbarpour

Suraj Malladi

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons.

[BibT_eX]

[DOI]

Nima Anari

Constantinos Daskalakis

Wolfgang Maass

Santosh S. Vempala

Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017

Approximation Algorithms for Computing Maximin Share Allocations.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2017

An O(log n/log log n)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem.

[BibT_eX]

[DOI]

Oper. Res., 2017

How Gamification Affects Physical Activity: Large-scale Analysis of Walking Challenges in a Mobile Application.

[BibT_eX]

[DOI]

Proceedings of the 26th International Conference on World Wide Web Companion, 2017

Information Aggregation in Overlapping Generations.

[BibT_eX]

[DOI]

Mohammad Akbarpour

Ali Shameli

Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Mobilizing the Crowd to Create an Open Repository of Research Talks.

[BibT_eX]

[DOI]

Rajan Vaish

Sharad Goel

Proceedings of the Fourth ACM Conference on Learning @ Scale, 2017

Nash Social Welfare, Matrix Permanent, and Stable Polynomials.

[BibT_eX]

[DOI]

Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices.

[BibT_eX]

[DOI]

Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016

A Simple and Efficient Algorithm for Computing Market Equilibria.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2016

Online Energy Storage Management: an Algorithmic Approach.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2016

2015

Team Formation Dynamics: A Study Using Online Learning Data.

[BibT_eX]

[DOI]

Milad Eftekhar

Farnaz Ronaghi

Proceedings of the 2015 ACM on Conference on Online Social Networks, 2015

2014

Panel: online learning platforms and data science.

[BibT_eX]

[DOI]

Proceedings of the First (2014) ACM Conference on Learning @ Scale, 2014

2013

Message-Passing Algorithms for Sparse Network Alignment.

[BibT_eX]

[DOI]

ACM Trans. Knowl. Discov. Data, 2013

Binary Opinion Dynamics with Stubborn Agents.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2013

Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising.

[BibT_eX]

[DOI]

Rakesh Vohra

Oper. Res., 2013

2012

Online Optimization with Uncertain Information.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2012

Santa claus meets hypergraph matchings.

[BibT_eX]

[DOI]

Uriel Feige

ACM Trans. Algorithms, 2012

Online Stochastic Matching: Online Actions Based on Offline Statistics.

[BibT_eX]

[DOI]

Shayan Oveis Gharan

Math. Oper. Res., 2012

Algorithmic Solutions for Envy-Free Cake Cutting.

[BibT_eX]

[DOI]

Xiaotie Deng

Qi Qi

Oper. Res., 2012

Price of Correlations in Stochastic Optimization.

[BibT_eX]

[DOI]

Oper. Res., 2012

Dynamics of prisoner's dilemma and the evolution of cooperation on networks.

[BibT_eX]

[DOI]

Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Distributed node placement algorithms for constructing well-connected sensor networks.

[BibT_eX]

[DOI]

Arthur J. Friend

Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011

Discrete Fixed Points: Models, Complexities, and Applications.

[BibT_eX]

[DOI]

Math. Oper. Res., 2011

Social Influence and Evolution of Market Share.

[BibT_eX]

[DOI]

Simla Ceyhan

Mohammad Mousavi

Internet Math., 2011

Prisoner's Dilemma on Graphs with Large Girth

[BibT_eX]

[DOI]

CoRR, 2011

The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus.

[BibT_eX]

[DOI]

Shayan Oveis Gharan

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

A Randomized Rounding Approach to the Traveling Salesman Problem.

[BibT_eX]

[DOI]

Shayan Oveis Gharan

Mohit Singh

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods.

[BibT_eX]

[DOI]

SIAM J. Comput., 2010

How to distribute antidote to control epidemics.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2010

The spread of innovations in social networks.

[BibT_eX]

[DOI]

Proc. Natl. Acad. Sci. USA, 2010

Advertisement allocation for generalized second-pricing schemes.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2010

A Sequential Algorithm for Generating Random Graphs.

[BibT_eX]

[DOI]

Mohsen Bayati

Jeong Han Kim

Algorithmica, 2010

Approximating power indices: theoretical and empirical analysis.

[BibT_eX]

[DOI]

Jeffrey S. Rosenschein

Auton. Agents Multi Agent Syst., 2010

Subgraph sparsification and nearly optimal ultrasparsifiers.

[BibT_eX]

[DOI]

Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010

An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem.

[BibT_eX]

[DOI]

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

Correlation Robust Stochastic Optimization.

[BibT_eX]

[DOI]

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

2009

Convergence to equilibrium in local interaction games.

[BibT_eX]

[DOI]

SIGecom Exch., 2009

On the Complexity of Envy-Free Cake Cutting

[BibT_eX]

[DOI]

Xiaotie Deng

Qi Qi

CoRR, 2009

Distributionally Robust Stochastic Programming with Binary Random Variables

[BibT_eX]

[DOI]

CoRR, 2009

On the Inefficiency Ratio of Stable Equilibria in Congestion Games.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Generating random graphs with large girth.

[BibT_eX]

[DOI]

Mohsen Bayati

Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Algorithms for Large, Sparse Network Alignment Problems.

[BibT_eX]

[DOI]

Proceedings of the ICDM 2009, 2009

Cutting a Cake for Five People.

[BibT_eX]

[DOI]

Ying Wang

Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008

The complexity of equilibria: Hardness results for economies via a correspondence with games.

[BibT_eX]

[DOI]

Bruno Codenotti

Kasturi R. Varadarajan

Yinyu Ye

Theor. Comput. Sci., 2008

Minimizing Effective Resistance of a Graph.

[BibT_eX]

[DOI]

Arpita Ghosh

Stephen P. Boyd

SIAM Rev., 2008

A Monte Carlo method for solving unsteady adjoint equations.

[BibT_eX]

[DOI]

J. Comput. Phys., 2008

Market equilibrium via a primal-dual algorithm for a convex program.

[BibT_eX]

[DOI]

Nikhil R. Devanur

Vijay V. Vazirani

J. ACM, 2008

Convergence to Equilibrium in Local Interaction Games and Ising Models

[BibT_eX]

[DOI]

CoRR, 2008

Stochastic Combinatorial Optimization under Probabilistic Constraints

[BibT_eX]

[DOI]

Shipra Agrawal

Yinyu Ye

CoRR, 2008

Dynamic cost-per-action mechanisms and applications to online advertising.

[BibT_eX]

[DOI]

Rakesh Vohra

Proceedings of the 17th International Conference on World Wide Web, 2008

A Fast and Simple Algorithm for Computing Market Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Stochastic Submodular Maximization.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Approximating power indices.

[BibT_eX]

[DOI]

Yoram Bachrach

Evangelos Markakis

Ariel D. Procaccia

Jeffrey S. Rosenschein

Mohammad Taghi Hajiaghayi

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

2007

Cell Breathing in Wireless LANs: Algorithms and Evaluation.

[BibT_eX]

[DOI]

Paramvir Bahl

IEEE Trans. Mob. Comput., 2007

AdWords and generalized online matching.

[BibT_eX]

[DOI]

J. ACM, 2007

Random Walks with Lookahead on Power Law Random Graphs.

[BibT_eX]

[DOI]

Prasad Tetali

Internet Math., 2007

Allocating online advertisement space with unreliable estimates.

[BibT_eX]

[DOI]

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

Approximating nash equilibria using small-support strategies.

[BibT_eX]

[DOI]

Tomás Feder

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

Towards Topology Aware Networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006

Random walks in peer-to-peer networks: Algorithms and evaluation.

[BibT_eX]

[DOI]

Perform. Evaluation, 2006

On certain connectivity properties of the internet topology.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2006

Multi-unit auctions with unknown supply.

[BibT_eX]

[DOI]

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

A Local Switch Markov Chain on Given Degree Graphs with Application in Connectivity of Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005

Leontief Economies Encode Nonzero Sum Two-Player Games

[BibT_eX]

[DOI]

Bruno Codenotti

Kasturi R. Varadarajan

Yinyu Ye

Electron. Colloquium Comput. Complex., 2005

On the core of the multicommodity flow game.

[BibT_eX]

[DOI]

Evangelos Markakis

Decis. Support Syst., 2005

Price of Anarchy, Locality Gap, and a Network Service Provider Game.

[BibT_eX]

[DOI]

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

On the spread of viruses on the internet.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Multi-unit auctions with budget-constrained bidders.

[BibT_eX]

[DOI]

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

Hybrid search schemes for unstructured peer-to-peer networks.

[BibT_eX]

[DOI]

Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

AdWords and Generalized On-line Matching.

[BibT_eX]

[DOI]

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

2004

On approximately fair allocations of indivisible goods.

[BibT_eX]

[DOI]

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

Exploring the community structure of newsgroups.

[BibT_eX]

[DOI]

Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

Random Walks in Peer-to-Peer Networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

2003

Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP.

[BibT_eX]

[DOI]

J. ACM, 2003

Conductance and congestion in power law graphs.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2003

Approximating Market Equilibria.

[BibT_eX]

[DOI]

Kamal Jain

Proceedings of the Approximation, 2003

2002

A new greedy approach for facility location problems.

[BibT_eX]

[DOI]

Kamal Jain

Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

On the Hardness of Optimal Auctions.

[BibT_eX]

[DOI]

Amir Ronen

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Market Equilibrium via a Primal-Dual-Type Algorithm.

[BibT_eX]

[DOI]

Nikhil R. Devanur

Vijay V. Vazirani

Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001

A Greedy Facility Location Algorithm Analyzed Using Dual Fitting.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2001

2000

On a conjecture of Keedwell and the cycle double cover conjecture.

[BibT_eX]

[DOI]

Ebadollah S. Mahmoodian

Mohammad Taghi Hajiaghayi

Mohammad R. Salavatipour

Ruzbeh Tusserkani

Discret. Math., 2000

On the simultaneous edge-coloring conjecture.

[BibT_eX]

[DOI]

Ebadollah S. Mahmoodian

Seyed Vahab Mirrokni