Simina Brânzei
Economics, Econometrics and Finance · Purdue University West Lafayette
Publications
90
Citations
692
Est. group size
—
Recurring co-author estimate
Active years
18
Publishing since 2009
Simina Brânzei works in algorithmic game theory and computational economics, studying how algorithms and strategic behavior interact in settings like auctions, fair division (e.g., splitting cake or chores fairly), and market dynamics. A significant part of the work also examines the computational complexity of finding equilibria or fixed points (stable solutions) in games and economic models, often using tools from theoretical computer science such as query complexity analysis.
Publication output has remained fairly steady over the last decade, fluctuating between about 2 and 7 papers per year without a clear long-term increase or decrease.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- The Query Complexity of Local Search in Rounds on General Graphs
arXiv (Cornell University) · 2026
- Accelerating Scientific Research with Gemini: Case Studies and Common Techniques
arXiv (Cornell University) · 2026
- Dueling over Multiple Pieces of Dessert
arXiv (Cornell University) · 2026
- The query complexity of local search and Brouwer in rounds
Mathematical Statistics and Learning · 2026
- Tit-for-tat strategies drive growth and inequality in production economies
Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · 2025
- The randomized query complexity of finding a Tarski fixed point on the Boolean hypercube
Discrete Mathematics · 2025
- Tarski Lower Bounds from Multi-Dimensional Herringbones
arXiv (Cornell University) · 2025
- Computing Envy-Free up to Any Good (EFX) Allocations via Local Search
arXiv (Cornell University) · 2025
- Tit-for-tat dynamics and market volatility
Nonlinearity · 2024
- The Sharp Power Law of Local Search on Expanders
Society for Industrial and Applied Mathematics eBooks · 2024
- Dueling Over Dessert, Mastering the Art of Repeated Cake Cutting
arXiv (Cornell University) · 2024
- Spectral Lower Bounds for Local Search
arXiv (Cornell University) · 2024
- The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
arXiv (Cornell University) · 2024
- A note on quantum lower bounds for local search via congestion and expansion
arXiv (Cornell University) · 2024
- Dueling over Dessert, Mastering the Art of Repeated Cake Cutting
2024
- arXiv (Cornell University)×26
- Proceedings of the AAAI Conference on Artificial Intelligence×3
- Pattern Recognition×1
- Figshare×1
- Mathematics of Operations Research×1
- Deepal Basak
Economics, Econometrics and Finance · Indiana University
- Thành Nguyen
Economics, Econometrics and Finance · Purdue University West Lafayette
- Yaron Azrieli
Economics, Econometrics and Finance · The Ohio State University
- Haoyu Song
Economics, Econometrics and Finance · Purdue University West Lafayette
- Scott L. Feld
Economics, Econometrics and Finance · Purdue University West Lafayette
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 20, 2026.
Claim or correct this profile