Federico Echenique

According to our database1, Federico Echenique authored at least 35 papers between 2003 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Third-Party Data Providers Ruin Simple Mechanisms.
Proc. ACM Meas. Anal. Comput. Syst., 2020

The Pareto Comparisons of a Group of Exponential Discounters.
Math. Oper. Res., 2020

Spherical preferences.
J. Econ. Theory, 2020

The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies.
Proceedings of the EC '20: The 21st ACM Conference on Economics and Computation, 2020

Incentive Compatible Active Learning.
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
New developments in revealed preference theory: decisions under risk, uncertainty, and intertemporal choice.
CoRR, 2019

Fairness and efficiency for probabilistic allocations with endowments.
CoRR, 2019

2018
The perception-adjusted Luce model.
Math. Soc. Sci., 2018

A Characterization of Combinatorial Demand.
Math. Oper. Res., 2018

Learnability and Models of Decision Making under Uncertainty.
Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

2017
Ordinal and cardinal solution concepts for two-sided matching.
Games Econ. Behav., 2017

2016
The Empirical Implications of Privacy-Aware Choice.
Oper. Res., 2016

2014
Testing for separability is hard.
CoRR, 2014

On the Existence of Low-Rank Explanations for Mixed Strategy Behavior.
Proceedings of the Web and Internet Economics - 10th International Conference, 2014

2013
The Complexity of Nash Equilibria as Revealed by Data.
CoRR, 2013

The empirical implications of rank in Bimatrix games.
Proceedings of the fourteenth ACM Conference on Electronic Commerce, 2013

2012
When does aggregation reduce risk aversion?
Games Econ. Behav., 2012

Finding a walrasian equilibrium is easy for a fixed number of agents.
Proceedings of the 13th ACM Conference on Electronic Commerce, 2012

2011
Complexity and economics: computational constraints may not matter empirically.
SIGecom Exch., 2011

A revealed preference approach to computational complexity in economics.
Proceedings of the Proceedings 12th ACM Conference on Electronic Commerce (EC-2011), 2011

2010
On behavioral complementarity and its implications.
J. Econ. Theory, 2010

2009
Sequential entry in many-to-one matching markets.
Soc. Choice Welf., 2009

English auctions and the Stolper-Samuelson theorem.
J. Econ. Theory, 2009

Supermodularity and preferences.
J. Econ. Theory, 2009

2008
What Matchings Can Be Stable? The Testable Implications of Matching Theory.
Math. Oper. Res., 2008

2007
Finding all equilibria in games of strategic complements.
J. Econ. Theory, 2007

A solution to matching with preferences over colleagues.
Games Econ. Behav., 2007

Counting combinatorial choice rules.
Games Econ. Behav., 2007

2005
A short and constructive proof of Tarski's fixed-point theorem.
Int. J. Game Theory, 2005

2004
Information is not about measurability.
Math. Soc. Sci., 2004

Core many-to-one matchings by fixed-point methods.
J. Econ. Theory, 2004

Mixed equilibria are unstable in games of strategic complements.
J. Econ. Theory, 2004

Extensive-form games and strategic complementarities.
Games Econ. Behav., 2004

A characterization of strategic complementarities.
Games Econ. Behav., 2004

2003
Strong comparative statics of equilibria.
Games Econ. Behav., 2003


  Loading...