Author: Solymosi Tamás

May 22 (10:00-11:00) room C.510 David Bartl (Silesian University in Opava, Czechia) Farkas’ lemma and linear programming in the infinite case We consider the linear programming problem in the setting of a general vector space over a linearly ordered (commutative Continue Reading …

May 15 (10:00-11:00) room C.510 Zsófia Dornai (HUN-REN Centre for Economic and Regional Studies, Institute of Economics, Game Theory Research Group) TU-games with utility functions: dually u-essential coalitions and other characterization sets for the u-prenucleolus The u-prenucleolus is a generalization of Continue Reading …

May 8 (10:00-11:00) room C.510 Christopher Stapenhurst (QSMS, Budapest University of Technology) Red or Gold? Clausen and Stapenhurst (2024) obtain a lower bound on the cost of the optimal static, bribe-proof mechanism. But what about dynamic mechanisms? We propose a Continue Reading …

Apr. 16 (Wednesday) 11:40-12:40, room E.218 (main building) Humberto Moreira (FGV/EPGE Escola Brasileira de Economia e Finança) Auction design using value prediction with hallucinations We investigate a Bayesian mechanism design problem where a seller seeks to maximize revenue by selling an Continue Reading …

Apr. 10 (10:00-11:00) room C.510 Mánuel Mágó (Corvinus) The participation surplus value, equal division, and a family containing both We consider cooperative transferable utility games. We define a new solution concept, called the participation surplus value, that assigns to every Continue Reading …

Apr. 3 (10:00-11:00) room C.510 Zsuzsanna Jankó (Corvinus) Stable matchings and distributive lattices It is a classic result that the set of one-to-one stable matchings form a distributive lattice. We generalize this to many-to-many matchings with substitutable and IRC choice functions, and Continue Reading …

Mar. 27 (10:00-11:00) room C.510 Pierre von Mouche (Wageningen University, NL, and Corvinus) On Cournot oligopolies with a biconcave price function The power of a recent result for Nash equilibria of sum-aggregative games [1] is illustrated by providing a variant Continue Reading …

Mar. 20 (10:00-11:00) room C.510 Héctor Hermida Rivera (QSMS, Budapest University of Technology) Self-equivalent voting rules In this paper, I introduce a novel stability axiom for stochastic voting rules—called self-equivalence—by which a society considering whether to replace its voting rule Continue Reading …

Mar. 13 (10:00-11:00) room C.510 Helmuts Azacis (Cardiff University, UK, and Corvinus) Unmediated communication in games with (in)complete information: the 4-player case We show that every rational correlated equilibrium of any finite game with complete information and four players can Continue Reading …

Mar. 6 (10:00-11:00) room C.510 Zhenyu Hu (National University of Singapore) Stable and monotonic allocation in risk pooling problems In many practical scenarios, agents collaborate to leverage the benefits of risk pooling. Two prominent examples include inventory pooling among newsvendors Continue Reading …