Concentration on the Boolean hypercube via pathwise stochastic analysis

Autor: Renan Gross, Ronen Eldan

Publikováno v: STOC
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing

We develop a new technique for proving concentration inequalities which relate between the variance and influences of Boolean functions. Using this technique, we 1. Settle a conjecture of Talagrand [Tal97] proving that $$\int_{\left\{ -1,1\right\} ^{

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7301233a7704ce65cc20930974cf3b8c
https://doi.org/10.1007/s00222-022-01135-8

Equality and responsibility: Ex ante and ex post redistribution mechanisms

Autor: Z. Emel Öztürk, Kristof Bosmans

Publikováno v: Economic Theory, 73(4), 947-975. Springer Verlag
Economic Theory, 73(4), 947-975. Springer New York

We study redistribution in a setting where individual responsibility and circumstance characteristics determine pre-tax income. We distinguish between ex ante and ex post versions of the key principles of compensation and reward. Furthermore, we dist

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::896f428615280086c747b87743b4a845
https://doi.org/10.1007/s00199-020-01334-5

Risk aversion for losses and the Nash bargaining solution

Autor: Hans Peters

Publikováno v: Theory and Decision, 92(3-4), 703-715. Springer, Cham

We call a decision maker risk averse for losses if that decision maker is risk averse with respect to lotteries having alternatives below a given reference alternative in their support. A two-person bargaining solution is called invariant under risk

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b2aa6a07f59a0bd0038617bb8388f2a
https://doi.org/10.1007/s11238-021-09837-w

The Big Match with a Clock and a Bit of Memory

Autor: Hansen, Kristoffer Arnsfelt, Ibsen-Jensen, Rasmus, Neyman, Abraham, Machinery, Assoc Comp

Publikováno v: Hansen, K A, Ibsen-Jensen, R & Neyman, A 2023, ' The Big Match with a Clock and a Bit of Memory ', Mathematics of Operations Research, vol. 48, no. 1, pp. 419-432 . https://doi.org/10.1287/moor.2022.1267
ACM EC'18: PROCEEDINGS OF THE 2018 ACM CONFERENCE ON ECONOMICS AND COMPUTATION
Hansen, K A, Ibsen-Jensen, R & Neyman, A 2018, The Big Match with a Clock and a Bit of Memory . in É Tardos, E Elkind & R Vohra (eds), Proceedings of the 2018 ACM Conference on Economics and Computation, Ithaca, NY, USA, June 18-22, 2018 . Association for Computing Machinery, Ithaca, NY, USA, pp. 149-150, The nineteenth ACM conference on Economics and Computation (ACM EC’18), Ithaca, New York, United States, 18/06/2018 . https://doi.org/10.1145/3219166.3219198
MATHEMATICS OF OPERATIONS RESEARCH
EC

The Big Match is a multistage two-player game. In each stage, player 1 hides one or two pebbles in his hand, and his opponent has to guess that number. Player 1 loses a point if player 2 is correct; otherwise, he wins a point. As soon as player 1 hid

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ffe78f640ecf96cd1a38c3e9432e0e83
https://pure.au.dk/portal/da/publications/the-big-match-with-a-clock-and-a-bit-of-memory(7583e785-e36a-4210-abe8-2736de05ee47).html

Preemption with a second-mover advantage

Autor: Andrew Wait, Vladimir Smirnov

Publikováno v: Games and Economic Behavior. 129:294-309

We examine a timing game with complete information and observable actions when there is a second-mover advantage. Allowing for heterogenous payoffs between players and for both leader and follower payoff functions to be multi-peaked and non-monotonic

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::66483644eb91ba4a0d7e061d32e2c1f3
https://doi.org/10.1016/j.geb.2021.06.003