Itai Ashlagi

According to our database1, Itai Ashlagi authored at least 53 papers between 2005 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Simple Economies are Almost Optimal.
CoRR, 2021

Tiered Random Matching Markets: Rank Is Proportional to Popularity.
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020
Clearing Matching Markets Efficiently: Informative Signals and Match Recommendations.
Manag. Sci., 2020

What matters in school choice tie-breaking? How competition guides design.
J. Econ. Theory, 2020

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

Tiered Random Matching Markets: Rank is Proportional to Popularity.
CoRR, 2020

Assortment Planning for Two-Sided Sequential Matching Markets.
Proceedings of the Web and Internet Economics - 16th International Conference, 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
On Matching and Thickness in Heterogeneous Dynamic Markets.
Oper. Res., 2019

Assigning more students to their top choices: A comparison of tie-breaking rules.
Games Econ. Behav., 2019

Scrip Systems with Minimal Availability.
Proceedings of the Web and Internet Economics - 15th International Conference, 2019

Discrimination in Online Markets: Effects of Social Bias on Learning from Reviews and Policy Design.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

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

2018
Stable matching mechanisms are not obviously strategy-proof.
J. Econ. Theory, 2018

Maximum Weight Online Matching with Deadlines.
CoRR, 2018

Maximizing Efficiency in Dynamic Matching Markets.
CoRR, 2018

2017
Efficient Dynamic Barter Exchange.
Oper. Res., 2017

Communication Requirements and Informative Signaling in Matching Markets.
Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Min-Cost Bipartite Perfect Matching with Delays.
Proceedings of the Approximation, 2017

2016
Optimal Allocation Without Money: An Engineering Approach.
Manag. Sci., 2016

What Matters in School Choice Tie-breakings?: How Competition Guides Design.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

Sequential Mechanisms with Ex-post Participation Guarantees.
Proceedings of the 2016 ACM Conference on Economics and Computation, 2016

2015
Kidney Exchange and the Alliance for Paired Donation: Operations Research Changes the Way Kidneys Are Transplanted.
Interfaces, 2015

Mix and match: A strategyproof mechanism for multi-hospital kidney exchange.
Games Econ. Behav., 2015

Dating Strategies Are Not Obvious.
CoRR, 2015

A dynamic model of barter exchange.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Assigning More Students to their Top Choices: A Tiebreaking Rule Comparison.
Proceedings of the Sixteenth ACM Conference on Economics and Computation, 2015

2014
Improving Community Cohesion in School Choice via Correlated-Lottery Implementation.
Oper. Res., 2014

Stability in Large Matching Markets with Complementarities.
Oper. Res., 2014

2013
Unbalanced random matching markets.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Kidney exchange in dynamic sparse heterogenous pools.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

Equilibria of Online Scheduling Algorithms.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Characterizing Vickrey allocation rule by anonymity.
Soc. Choice Welf., 2012

Manipulability in matching markets: conflict and coincidence of interests.
Soc. Choice Welf., 2012

A non-cooperative support for equal division in estate division problems.
Math. Soc. Sci., 2012

Optimal Lower Bounds for Anonymous Scheduling Mechanisms.
Math. Oper. Res., 2012

2011
Simultaneous Ad Auctions.
Math. Oper. Res., 2011

Individual rationality and participation in large scale, multi-hospital kidney exchange.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

Matching with couples revisited.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010
Mix and match.
Proceedings of the Proceedings 11th ACM Conference on Electronic Commerce (EC-2010), 2010

Competing Schedulers.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
VCG is the best anonymous scheduling mechanism.
SIGecom Exch., 2009

Mediators in position auctions.
Games Econ. Behav., 2009

Two-terminal routing games with unknown active players.
Artif. Intell., 2009

An optimal lower bound for anonymous scheduling mechanisms.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

2008
On the Value of Correlation.
J. Artif. Intell. Res., 2008

Social Context Games.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

2007
K-NCC: Stability Against Group Deviations in Non-cooperative Computation.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

Routing games with an unknown set of active players.
Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2007), 2007

Learning Equilibrium in Resource Selection Games.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Robust Learning Equilibrium.
Proceedings of the UAI '06, 2006

Resource selection games with unknown number of players.
Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2006), 2006

2005
The Value of Correlation in Strategic Form Games.
Proceedings of the Computing and Markets, 3.-7. January 2005, 2005


  Loading...