Publications
Advanced search
| Number | Authour(s) | Title |
Date |
Published in | Abstract | Paper |
|---|---|---|---|---|---|---|
| 94 | Robert J. Aumann, Sergiu Hart & Motty Perry | The Absent-Minded Driver | (01/1996) | Games and Economic Behavior 20 (1997), 102-116 |
The example of the "absent-minded driver" was introduced by Piccione & Rubinstein [1995] in... |
 driver.html |
| 90 | Mor Amitai | Cheap-Talk with Incomplete Information on Both Sides | (01/1996) |
We provide a characterization of the set of equilibria of two-person cheap-talk games with... |
 dp90.pdf |
|
| 91 | Mor Amitai | Cheap-Talk with Random Stopping | (01/1996) |
Cheap-Talk with Random Stopping is a Cheap-Talk game in which after each period of communication... |
dp91.pdf |
|
| 92 | Theo S. H. Driessen | Tree Enterprises and Bankruptcy Ventures: A Game-Theoretic Similarity Due to a Graph-Theoretic Proof | (01/1996) | Discrete Applied Mathematics 79 (1997), 105-117 |
In a tree enterprise, users reside at the nodes of the tree and their aim is to connect... |
dp92.pdf |
| 95 | Gary Bornstein, Eyal Winter & Harel Goren | Experimental Study of Repeated Team-Games | (01/1996) | European Journal of Political Economy 12 (1996), 629-639 |
We report an experiment in which the Intergroup Prisoner's Dilemma (IPD) game was contrasted... |
dp95.pdf |
| 93 | Theo S. H. Driessen | An Alternative Game-Theoretic Analysis of a Bankruptcy Problem from the Talmud: The Case of the Greedy Bankruptcy Game | (01/1996) | In: Game Theory IV, year 1998 (yearbook ''Theory of Games and Applications'') (Eds. L.A. Petrosjan and V.V. Mazalov) Nova Science Publishers Inc., New York, USA (1998), 45-61 |
The bankruptcy problem from the Talmud is modelled as a game (in coalitional form with... |
|
| 98 | Dan S. Felsenthal, Moshe Machover | Ternary Voting Games | (02/1996) | International Journal of Game Theory 26 (1997), 335-351 |
We define ternary voting games (TVGs), a generalization of simple voting games (SVGs). In a play... |
dp98.pdf |
| 99 | Mordecai Haimovich | The Simplex Algorithm Is Very Good!: On the Expected Number of Pivot Steps and Related Properties of Random Linear Programs | (02/1996) |
In their paper How Good is the Simplex Algorithm?, Klee and Minty exhibited a sequence of linear... |
||
| 101 | Sergiu Hart & Benjamin Weiss | Significance Levels for Multiple Tests | (03/1996) | Statistics and Probability Letters 35 (1997), 43-48 |
Let X1, ... , Xn be n random variables, with cumulative distribution functions F1, ... , Fn.... |
probs.html |
| 100 | Ran El-Yaniv & Richard M. Karp | Nearly Optimal Competitive Online Replacement Policies | (03/1996) | Mathematics of Operations Research 22 (1997), 814-839. |
This Paper studies the following online replacement problem. There is a real function f(t),... |
