Amin Saberi

According to our database1, Amin Saberi authored at least 98 papers between 2000 and 2020.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Assignment Mechanisms Under Distributional Constraints.
Oper. Res., 2020

Sampling Arborescences in Parallel.
CoRR, 2020

Online Hypergraph Matching with Delays.
CoRR, 2020

Ranking an Assortment of Products via Sequential Submodular Optimization.
CoRR, 2020

Queue Lengths as Constantly Adapting Prices: Allocative Efficiency Under Random Dynamics.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

2019
Competition in Ride-Hailing Markets.
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.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Edge Weighted Online Windowed Matching.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018
Generating Random Networks Without Short Cycles.
Oper. Res., 2018

Maximum Weight Online Matching with Deadlines.
CoRR, 2018

Maximizing Efficiency in Dynamic Matching Markets.
CoRR, 2018

Creating Crowdsourced Research Talks at Scale.
Proceedings of the 2018 World Wide Web Conference on World Wide Web, 2018

Prophet Inequalities vs. Approximating Optimum Online.
Proceedings of the Web and Internet Economics - 14th International Conference, 2018

Approximating the Largest Root and Applications to Interlacing Families.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Diffusion, Seeding, and the Value of Network Information.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons.
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.
ACM Trans. Algorithms, 2017

An <i>O</i>(log <i>n</i>/log log <i>n</i>)-Approximation Algorithm for the Asymmetric Traveling Salesman Problem.
Oper. Res., 2017

How Gamification Affects Physical Activity: Large-scale Analysis of Walking Challenges in a Mobile Application.
Proceedings of the 26th International Conference on World Wide Web Companion, 2017

Information Aggregation in Overlapping Generations.
Proceedings of the Web and Internet Economics - 13th International Conference, 2017

Mobilizing the Crowd to Create an Open Repository of Research Talks.
Proceedings of the Fourth ACM Conference on Learning @ Scale, 2017

Nash Social Welfare, Matrix Permanent, and Stable Polynomials.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

2016
A Simple and Efficient Algorithm for Computing Market Equilibria.
ACM Trans. Algorithms, 2016

Online Energy Storage Management: an Algorithmic Approach.
Proceedings of the Approximation, 2016

2015
Team Formation Dynamics: A Study Using Online Learning Data.
Proceedings of the 2015 ACM on Conference on Online Social Networks, 2015

2014
Panel: online learning platforms and data science.
Proceedings of the First (2014) ACM Conference on Learning @ Scale, 2014

2013
Message-Passing Algorithms for Sparse Network Alignment.
ACM Trans. Knowl. Discov. Data, 2013

Binary Opinion Dynamics with Stubborn Agents.
ACM Trans. Economics and Comput., 2013

Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising.
Oper. Res., 2013

2012
Online Optimization with Uncertain Information.
ACM Trans. Algorithms, 2012

Santa claus meets hypergraph matchings.
ACM Trans. Algorithms, 2012

Online Stochastic Matching: Online Actions Based on Offline Statistics.
Math. Oper. Res., 2012

Algorithmic Solutions for Envy-Free Cake Cutting.
Oper. Res., 2012

Price of Correlations in Stochastic Optimization.
Oper. Res., 2012

Dynamics of prisoner's dilemma and the evolution of cooperation on networks.
Proceedings of the Innovations in Theoretical Computer Science 2012, 2012

Distributed node placement algorithms for constructing well-connected sensor networks.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011
Discrete Fixed Points: Models, Complexities, and Applications.
Math. Oper. Res., 2011

Social Influence and Evolution of Market Share.
Internet Math., 2011

Prisoner's Dilemma on Graphs with Large Girth
CoRR, 2011

The Asymmetric Traveling Salesman Problem on Graphs with Bounded Genus.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

A Randomized Rounding Approach to the Traveling Salesman Problem.
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.
SIAM J. Comput., 2010

How to distribute antidote to control epidemics.
Random Struct. Algorithms, 2010

The spread of innovations in social networks.
Proc. Natl. Acad. Sci. USA, 2010

Advertisement allocation for generalized second-pricing schemes.
Oper. Res. Lett., 2010

A Sequential Algorithm for Generating Random Graphs.
Algorithmica, 2010

Approximating power indices: theoretical and empirical analysis.
Auton. Agents Multi Agent Syst., 2010

Subgraph sparsification and nearly optimal ultrasparsifiers.
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.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Correlation Robust Stochastic Optimization.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
Convergence to equilibrium in local interaction games.
SIGecom Exch., 2009

On the Complexity of Envy-Free Cake Cutting
CoRR, 2009

Distributionally Robust Stochastic Programming with Binary Random Variables
CoRR, 2009

On the Inefficiency Ratio of Stable Equilibria in Congestion Games.
Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

Generating random graphs with large girth.
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009

Algorithms for Large, Sparse Network Alignment Problems.
Proceedings of the ICDM 2009, 2009

Cutting a Cake for Five People.
Proceedings of the Algorithmic Aspects in Information and Management, 2009

2008
The complexity of equilibria: Hardness results for economies via a correspondence with games.
Theor. Comput. Sci., 2008

Minimizing Effective Resistance of a Graph.
SIAM Rev., 2008

A Monte Carlo method for solving unsteady adjoint equations.
J. Comput. Phys., 2008

Market equilibrium via a primal-dual algorithm for a convex program.
J. ACM, 2008

Convergence to Equilibrium in Local Interaction Games and Ising Models
CoRR, 2008

Stochastic Combinatorial Optimization under Probabilistic Constraints
CoRR, 2008

Dynamic cost-per-action mechanisms and applications to online advertising.
Proceedings of the 17th International Conference on World Wide Web, 2008

A Fast and Simple Algorithm for Computing Market Equilibria.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Stochastic Submodular Maximization.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Approximating power indices.
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.
IEEE Trans. Mob. Comput., 2007

AdWords and generalized online matching.
J. ACM, 2007

Random Walks with Lookahead on Power Law Random Graphs.
Internet Math., 2007

Allocating online advertisement space with unreliable estimates.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Approximating nash equilibria using small-support strategies.
Proceedings of the Proceedings 8th ACM Conference on Electronic Commerce (EC-2007), 2007

Towards Topology Aware Networks.
Proceedings of the INFOCOM 2007. 26th IEEE International Conference on Computer Communications, 2007

2006
Random walks in peer-to-peer networks: Algorithms and evaluation.
Perform. Evaluation, 2006

On certain connectivity properties of the internet topology.
J. Comput. Syst. Sci., 2006

Multi-unit auctions with unknown supply.
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.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Leontief Economies Encode Nonzero Sum Two-Player Games
Electron. Colloquium Comput. Complex., 2005

On the core of the multicommodity flow game.
Decis. Support Syst., 2005

Price of Anarchy, Locality Gap, and a Network Service Provider Game.
Proceedings of the Internet and Network Economics, First International Workshop, 2005

On the spread of viruses on the internet.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Multi-unit auctions with budget-constrained bidders.
Proceedings of the Proceedings 6th ACM Conference on Electronic Commerce (EC-2005), 2005

Hybrid search schemes for unstructured peer-to-peer networks.
Proceedings of the INFOCOM 2005. 24th Annual Joint Conference of the IEEE Computer and Communications Societies, 2005

AdWords and Generalized On-line Matching.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004
On approximately fair allocations of indivisible goods.
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004

Exploring the community structure of newsgroups.
Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

Random Walks in Peer-to-Peer Networks.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

2003
Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP.
J. ACM, 2003

Conductance and congestion in power law graphs.
Proceedings of the International Conference on Measurements and Modeling of Computer Systems, 2003

Approximating Market Equilibria.
Proceedings of the Approximation, 2003

2002
A new greedy approach for facility location problems.
Proceedings of the Proceedings on 34th Annual ACM Symposium on Theory of Computing, 2002

On the Hardness of Optimal Auctions.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

Market Equilibrium via a Primal-Dual-Type Algorithm.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
A Greedy Facility Location Algorithm Analyzed Using Dual Fitting.
Proceedings of the Approximation, 2001

2000
On a conjecture of Keedwell and the cycle double cover conjecture.
Discret. Math., 2000

On the simultaneous edge-coloring conjecture.
Discret. Math., 2000


  Loading...