Corvinus Center For Operations Research
Corvinus University of Budapest
March 12 (Thursday) (10:00-11:00) room C.510 (new building, 5th floor) Tri-Dung Nguyen (University of Kent, United Kingdom) Game of banks – biform game theoretical framework for ATM network cost sharing Automated teller machines (ATM) play a major role in the Continue Reading …
March 5 (Thursday) (10:00-11:00) room C.510 (new building, 5th floor) Miklós Pintér (Corvinus University of Budapest) The nonemptiness of the core and no-arbitrage: Two sides of the same coin In cooperative game theory, the core is a central solution concept, Continue Reading …
February 26 (Thursday) (10:00-11:00) room C.510 (new building, 5th floor) Ákos Balázs (Corvinus University of Budapest) Generalised solution concepts in games without expected utility We propose a general framework for strategic interaction that relaxes the expected utility assumption and instead Continue Reading …
February 19 (Thursday) (10:00-11:00) room C.510 (new building, 5th floor) Emil Horobeț (Sapientia Hungarian University of Transylvania) The geometry of higher-order modern portfolio theory In this talk, we present a generalized modern portfolio theory with utility functions admitting higher-order cumulants. Continue Reading …
December 4 (Wednesday) (10:00-11:00) room C.510 (new building, 5th floor) Pinaki Mandal (Budapest University of Technology and Economics) Equivalence between individual and group strategy-proofness under stability When policymakers implement mechanisms in real-world institutions, they often prefer strategy-proof mechanisms over manipulable Continue Reading …
November 26 (Wednesday) (10:00-11:00) room E.118.2 (main building, 1st floor) Tamás Titkos (Corvinus University) Metric symmetries of Wasserstein spaces In recent decades, the theory of optimal transport has advanced rapidly, finding an ever-growing range of applications (including even game theory). Continue Reading …
November 20 (10:00-11:00) room E.118.2 (main building, 1st floor) Miklós Pintér (Corvinus University) Consistent Beliefs without Common Prior In a strand of the literature, it is assumed that the common prior has full support; that is, every type of every Continue Reading …
November 13 (10:00-11:00) room C.510 (new building, 5th floor) Tom Demeulemeester (University of Lausanne, Switzerland) Pairwise efficiency and monotonicity imply Pareto efficiency in (probabilistic) object allocation We consider object allocation problems with capacities (see, e.g., Abdulkadiroglu and Sönmez, 1998; Basteck, Continue Reading …
November 6 (10:00-11:00) room C.510 (new building, 5th floor) Gergely Kiss (Corvinus University) Quasi-arithmetic means, quasi-sums, and bisymmetry with and without regularity assumption Bisymmetry equation first appears in works of János Aczél, where it gains importance in the characterization of quasi-arithmetic Continue Reading …
October 9 (10:00-11:00) room E.118.2 (main building, 1st floor) Surajit Borkotokey (Dibrugarh University, India) Cooperative games with a-priori links This paper proposes a new framework for cooperative games where players possess pre-existing network connections. We integrate this network structure directly Continue Reading …