• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
Contacts

109028, Moscow,
Pokrovsky Boulevard 11, Rooms: S1029, S1030
Phone: +7 (495) 772-95-90*27172, 27173, 27174

Department Administration
Department Head Alexander Tarasov

PhD, Penn State University

Deputy Head Svetlana Seregina
Department Manager Disa Malbakhova
Senior Administrator Zulikhan Ibragimbeili
Senior Administrator Natalia Baibouzenko
Administrator Marina Yudina
Article
The Impact of ESG Ratings on Exchange-Traded Fund Flows

Dranev Y., Miriakov M., Ochirova E. et al.

Journal of Corporate Finance Research. 2024. Vol. 18. No. 1. P. 5-19.

Book chapter
The Lack of Public Health Spending and Economic Growth in Russia: A Regional Aspect

Olga Demidova, Elena Kayasheva, Artem Demyanenko.

In bk.: Eurasian Business and Economics Perspectives: Proceedings of the 38th Eurasia Business and Economics Society Conference. Vol. 25. Springer Publishing Company, 2023. Ch. 13. P. 209-232.

Working paper
The optimal design of elimination tournaments with a superstar

Tabashnikova D., Sandomirskaia M.

Economics. EC. Высшая школа экономики, 2023. No. 263.

Department of Theoretical Economics Research Seminar with Assistant Professor Alexander Karpov, HSE

12+
*recommended age
Event ended

Dear colleagues,  

Department of Theoretical Economics invites you to attend the research seminar with Assistant Professor Alexander Karpov, HSE

Date: February 2, 2021
Time: 1:00 p.m.
Working language: English
Speaker: Alexander Karpov, Assistant Professor of the Department of Theoretical Economics 

 

The link to Zoom: https://zoom.us/j/91397503260?pwd=bXJsLzFpZXdjV25VR2lXRndDcENkUT09
Access code: 913 9750 3260

Title: "Constructing Large Peak-Pit Condorcet Domains
Abstract: We present a new method of constructing Condorcet domains from pairs of Condorcet domains of smaller sizes (concatenation+shuffle scheme).The  concatenation+shuffle  scheme  provides  maximal,  connected,  copious, peak-pit domains whenever the original domains have these properties. It allows to construct maximal peak-pit Condorcet domains that are larger than those obtained by the Fishburn’s alternating scheme for all n≥13 alternatives. For a large number of alternatives n, we get a lower bound 2.1045^n for the cardinality of the largest peak-pit Condorcet domain and a lower bound 2.1890^n for the cardinality of the largest Condorcet domain, improving Fishburn’s result. We also show that all Arrow’s single-peaked domains can be constructed by concatenation+shuffle scheme starting from the trivial domain.