Typically, when semi-discrete approximations to time-dependent partial differential equations (PDE) or explicit multistep schemes for ordinary differential equation (ODE) are constructed they are derived such that they are stable and have a specified truncation error $\tau$. Under these conditions, the Lax--Richtmyer equivalence theorem assures that the scheme converges and that the error is, at most, of the order of $||\tau||$. In most cases, the error is in indeed of the order of $||\tau||$.
We demonstrate that schemes can be constructed, whose truncation errors are $\tau$, however, the actual errors are much smaller. This error reduction is done by constructing the schemes such that they inhibit the accumulation of the local errors, therefore they are called Error Inhibiting Schemes (EIS).
ADI DITKOWSKI, School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel. email: email@example.com
Bidding games are extensive form games, where in each turn players bid in order to determine who will play next. Zero-sum bidding games like Bidding Tic-Tac-Toe (also known as Richman games) have been extensively studied [Lazarus et al.'99, Develin and Payne '10]. We extend the theory of bidding games to general-sum two player games, showing the existence of pure subgame-perfect Nash equilibria (PSPE), and studying their properties. In particular, we show that the set of all PSPEs forms a semilattice, whose bottom point is unique. Our main result shows that if the underlying game has the form of a binary tree (only two actions available to the players in each node), then the Bottom PSPE is monotone in the budget, Pareto-efficient, and fair. In addition, we discuss applications of bidding games to combinatorial bargaining, and provide a polynomial-time algorithm to compute the Bottom PSPE. Joint work with Gil Kalai and Moshe Tennenholtz
==== NOTE THE SPECIAL TIME ===
Let M be a compact complex manifold. Consider the action of the diffeomorphism group Diff(M) on the (infinite-dimensional) space Comp(M) of complex structures. A complex structure is called ergodic if its Diff(M)-orbit is dense in the connected component of Comp(M). I will show that on a hyperkaehler manifold or a compact torus, a generic complex structure is ergodic. If time permits, I would explain geometric applications of these results to hyperbolicity. I would try to make the talk accessible to non-specialists.
A recent result characterizes the fully order reversing operators acting on the class of lower semicontinuous proper convex functions in a real Banach space as certain linear deformations of the Legendre-Fenchel transform. Motivated by the Hilbert space version of this result and by the well-known result saying that this convex conjugate transform has a unique fixed point (namely, the normalized energy function), we investigate the fixed point equation in which the involved operator is fully order reversing and acts on the above-mentioned class of functions. It turns out that this nonlinear equation is very sensitive to the involved parameters and can have no solution, a unique solution, or infinitely many ones. Our analysis yields a few byproducts, such as results related to positive semi-definite operators and to functional equations and inclusions involving monotone operators. The talk is based on joint work with Alfredo N. Iusem (IMPA) and Simeon Reich (The Technion).