Abstracts

Missing numbers are withdrawn papers where the presenter cannot attend the conference.

**Jump to abstract:**
1 2 3 4 5 6 7 8 9
10 11 13 14 15 16 17 19
20 21 22 23 24 25 26 27 29
30 31 32 36 40 41 43 44 45 46 49
50 53 54 55 59
60 61 62 63 64 65 67 69
72 73 75 76 77 78 79
80 82 83 84 85 86 87 88 89
90 91 92 93 94 95 96 97 98 99
100 102 103 104 105 106 107

Talk time: Thursday 24 July,
3:00-3:25 *Paper with full author
list*: Stony03.pdf (8 kB)

Talk time: Monday 21 July,
3:35-4:00 *Paper with full author
list*: BlowingWhistle.pdf
(210 kB, *revised June 4*)

Talk time: Thursday 24 July,
3:35-4:00 *Paper with full author
list*: arin.pdf (251 kB)

Talk time: Friday 25 July,
10:15-10:40 *Paper with full author
list*: AsanSanversbgt.pdf
(106 kB)

Talk time: Thursday 24 July,
10:50-11:15 *Paper with full author
list*: revisingdraftpr.pdf
(301 kB)

In this paper we investigate a modification to the fictitious play optimization heuristic. When calculating the empirical distribution of each player using standard fictitious play, each stage is weighted equally. Players in a game have no initial knowledge of their opponents mixed strategies and are more likely to make strategic mistakes in earlier stages. As the game progresses, the player begins to learn their opponents mixed strategies as they converge to the set of Nash Equilibrium. This intuition leads us to believe that weighting later stages more than earlier stages when calculating the empirical mixed strategy of all players may lead to faster convergence.

This paper investigates truncating weighting schemes. In a truncating weighting scheme weights are assigned to each stages, however, at some point, the amount of weight assigned to each play will be fixed. Numerous truncating weighting schemes are investigated using randomly generated games of various sizes. We compare results of the different weighting schemes against standard fictitious play.

Talk time: Wednesday 23 July,
3:35-4:00 *Paper with full author
list*: belsk-abs.txt (3 kB)

Talk time: Monday 21 July,
3:00-3:25 *Paper with full author
list*: ntuccv.pdf (333 kB)

Talk time: Monday 21 July,
10:50-11:15 *Paper with full author
list*: BergerUBRadapt.pdf
(266 kB)

Talk time: Tuesday 22 July,
3:35-4:00 *Paper with full author
list*: fp2xnub.pdf (165 kB)

- a plethora of outcomes, depending on where voters draw the line between acceptable and unacceptable candidates; and

- Condorcet losers and other lesser candidates, even in equilibrium.

But we argue that voters' judgments about candidate acceptability should take precedence over standard social-choice criteria, such as electing a Condorcet or Borda winner. Among other things, we show that

- sincere outcomes under all voting systems considered are AV outcomes, but not vice versa;

- a Condorcet winner's election under AV is always a strong Nash-equilibrium outcome but not under other systems; and

- outcomes that other systems cannot prevent can be prevented under AV.

Talk time: Tuesday 22 July,
3:00-3:25 *Paper with full author
list*: Sovereignty.pdf (149 kB)

Talk time: Wednesday 23 July,
10:50-11:15 *Paper with full author
list*: compgame.pdf
(169 kB, *revised June 20*)

Talk time: Monday 21 July,
3:00-3:25 *Paper with full author
list*: absentminded.pdf (7 kB)

Talk time: Monday 21 July,
3:35-4:00 *Paper with full author
list*: sellercheaptalk.pdf
(303 kB, *revised July 9*)

Talk time: Thursday 24 July,
3:00-3:25 *Paper with full author
list*: subjectiveSB.pdf (50 kB)

Talk time: Wednesday 23 July,
3:00-3:25 *Paper with full author
list*: dragan.txt (3 kB)

Talk time: Wednesday 23 July,
3:00-3:25 *Paper with full author
list*: gameconfpaper.pdf
(1082 kB)

Talk time: Thursday 24 July,
10:15-10:40 *Paper with full author
list*: abs-einy.pdf (51 kB)

Talk time: Thursday 24 July,
3:00-3:25 *Paper with full author
list*: CTS.pdf
(499 kB, *revised July 16*)

Talk time: Tuesday 22 July,
10:15-10:40 *Paper with full author
list*: ambiguouscontracts.pdf
(369 kB)

Talk time: Thursday 24 July,
10:15-10:40 *Paper with full author
list*: centroid.pdf (75 kB)

Talk time: Tuesday 22 July,
10:50-11:15 *Paper with full author
list*: paper.pdf (230 kB)

Talk time: Tuesday 22 July,
10:15-10:40 *Paper with full author
list*: ordinal.pdf
(328 kB, *revised July 9*)

Talk time: Monday 21 July,
10:15-10:40 *Paper with full author
list*: dorothea.txt (1 kB)

Talk time: Thursday 24 July,
3:35-4:00 *Paper with full author
list*: utilpap2.pdf (163 kB)

Talk time: Tuesday 22 July,
3:35-4:00 *Paper with full author
list*: QualitativeVotingAbstract.pdf
(470 kB, *revised July 9*)

Talk time: Monday 21 July,
3:35-4:00 *Paper with full author
list*: Imhofgames03.pdf
(57 kB, *revised May 16*)

Talk time: Monday 21 July,
10:15-10:40 *Paper with full author
list*: AE.pdf
(235 kB, *revised June 18*)

Talk time: Tuesday 22 July,
3:00-3:25 *Paper with full author
list*: Izmalkov-abstract.txt
(1 kB)

Talk time: Wednesday 23 July,
3:35-4:00 *Paper with full author
list*: AbstractJu.pdf (78 kB)

Tensions do not have only corporate character. Introduction of A380 adds another chapter in United States - European Union history of trade disputes. The A380 development is a $10.7 billion project, about one-third of which will be funded by European governments - members of the Airbus consortium. The United States has warned the European Union that any additional loans that European government - members will be making to Airbus to help fund the development of the A380 must be at the market rates in order not to violate the US - EC 1992 bilateral agreement.

In spite of all these corporate and political disputes, we believe that the questions this research project addresses can be usefully examined in terms of economic theory of market entry and incumbent response. The paper provides a simple and interesting approach to the problem of market division.

Talk time: Thursday 24 July,
10:50-11:15 *Paper with full author
list*: AbstractGameTheoryConference.pdf
(46 kB)

Talk time: Thursday 24 July,
10:15-10:40 *Paper with full author
list*: koczylauwersmindomset.pdf
(203 kB)

Talk time: Tuesday 22 July,
3:00-3:25 *Paper with full author
list*: koessler.pdf (255 kB)

Talk time: Monday 21 July,
10:15-10:40 *Paper with full author
list*: comm-abs.pdf (123 kB)

Talk time: Tuesday 22 July,
10:15-10:40 *Paper with full author
list*: kutmanabstract.pdf
(4 kB)

Talk time: Wednesday 23 July,
3:35-4:00 *Paper with full author
list*: Kvassov.pdf (22 kB)

Talk time: Thursday 24 July,
10:50-11:15 *Paper with full author
list*: FictMuri.pdf (102 kB)

Talk time: Friday 25 July,
10:15-10:40 *Paper with full author
list*: liuserfes.pdf
(49 kB, *revised June 2*)

Talk time: Tuesday 22 July,
3:35-4:00 *Paper with full author
list*: xluo.pdf
(374 kB, *revised June 16*)

The possibility of facilitating exchange through the use of an escrow service is considered. Conditions are determined under which the agent acting first will employ such a service in order to ensure successful exchange (as opposed to ensuring successful exchange through the disposal of his own relative bargaining advantage).

Talk time: Wednesday 23 July,
10:15-10:40 *Paper with full author
list*: MathewsPaper2.pdf
(360 kB)

Talk time: Friday 25 July,
10:15-10:40 *Paper with full author
list*: Matsuhisa.pdf (168 kB)

Talk time: Wednesday 23 July,
3:00-3:25 *Paper with full author
list*: Locator.pdf (186 kB)

Talk time: Wednesday 23 July,
3:35-4:00 *Paper with full author
list*: NapelWidgrenPaper.pdf
(305 kB)

Talk time: Tuesday 22 July,
3:00-3:25 *Paper with full author
list*: ttdconf.pdf (230 kB)

Talk time: Friday 25 July,
10:50-11:15 *Paper with full author
list*: coajpet1.pdf (226 kB)

Talk time: Wednesday 23 July,
10:15-10:40 *Paper with full author
list*: interaer1.pdf
(277 kB, *revised July 20*)

Talk time: Monday 21 July,
10:15-10:40 *Paper with full author
list*: hyperfunctions.pdf
(215 kB)

Talk time: Friday 25 July,
10:50-11:15 *Paper with full author
list*: ssgv.pdf (157 kB)

Talk time: Monday 21 July,
10:50-11:15 *Paper with full author
list*: acc3.pdf (290 kB)

Talk time: Monday 21 July,
3:35-4:00 *Paper with full author
list*: evol.pdf
(455 kB, *revised July 16*)

Talk time: Tuesday 22 July,
10:50-11:15 *Paper with full author
list*: rationalisation.pdf
(159 kB)

Talk time: Wednesday 23 July,
10:15-10:40 *Paper with full author
list*: Sanchez.pdf (103 kB)

Talk time: Monday 21 July,
10:50-11:15 *Paper with full author
list*: ozyurtsanver.pdf (298 kB)

Talk time: Tuesday 22 July,
3:00-3:25 *Paper with full author
list*: savani.txt (1 kB)

Talk time: Thursday 24 July,
3:35-4:00 *Paper with full author
list*: Schanzabstract.pdf
(280 kB, *revised July 9*)

Talk time: Friday 25 July,
10:50-11:15 *Paper with full author
list*: heifetzmeierschipper.pdf
(129 kB, *revised May 23*)

Talk time: Wednesday 23 July,
10:50-11:15 *Paper with full author
list*: regret4.pdf (290 kB)

Talk time: Monday 21 July,
10:50-11:15 *Paper with full author
list*: obscostWP.pdf (254 kB)

Talk time: Monday 21 July,
3:00-3:25 *Paper with full author
list*: MathewsAbstract1.pdf
(59 kB)

Talk time: Thursday 24 July,
3:35-4:00 *Paper with full author
list*: StonyBrookprop03.pdf
(100 kB)

Talk time: Friday 25 July,
10:15-10:40 *Paper with full author
list*: bvv.pdf (164 kB)

Talk time: Tuesday 22 July,
3:35-4:00 *Paper with full author
list*: shapley-ntu6.pdf (299 kB)

Talk time: Wednesday 23 July,
10:50-11:15 *Paper with full author
list*: viossat.pdf
(168 kB, *revised July 17*)

Talk time: Thursday 24 July,
3:35-4:00 *Paper with full author
list*: vonSchemde.pdf
(115 kB, *revised July 1*)

Talk time: Wednesday 23 July,
10:15-10:40 *Paper with full author
list*: EFCE.pdf (87 kB)

Talk time: Tuesday 22 July,
10:50-11:15 *Paper with full author
list*: WQSB.pdf
(208 kB, *revised June 13*)

Talk time: Monday 21 July,
3:00-3:25 *Paper with full author
list*: Abs-watanabe.pdf (109 kB)

Talk time: Friday 25 July,
10:50-11:15 *Paper with full author
list*: osv2.pdf (366 kB)

Talk time: Wednesday 23 July,
3:35-4:00 *Paper with full author
list*: gloves4.pdf
(249 kB, *revised July 17*)

Talk time: Friday 25 July,
10:15-10:40 *Paper with full author
list*: introductionnew.pdf
(95 kB)

Talk time: Monday 21 July,
10:15-10:40 *Paper with full author
list*: Zapechelnyuk.pdf (89 kB)

Talk time: Thursday 24 July,
10:50-11:15 *Paper with full author
list*: CS00.pdf (263 kB)

Talk time: Wednesday 23 July,
3:00-3:25 *Paper with full author
list*: stbr.pdf
(47 kB, *revised Apr 23*)

In this paper we generalize the Radzik's results to two-person non-zero-sum matrix games. The games described by such payoff matrices well approximate continuous games on the unit square with payoff functions F1(x, y) concave in x for each y, and F2(x, y) concave in y for each x. It is shown, that the optimal strategies in such games have very simple structure and a search procedure is given.

Talk time: Wednesday 23 July,
3:00-3:25 *Paper with full author
list*: Polowczuk.pdf
(49 kB, *revised Apr 30*)

Talk time: Wednesday 23 July,
10:50-11:15 *Paper with full author
list*: eg.pdf
(62 kB, *revised Apr 30*)

Talk time: Wednesday 23 July,
10:15-10:40 *Paper with full author
list*: giorgos.pdf
(41 kB, *revised May 11*)

Talk time: Tuesday 22 July,
10:15-10:40 *Paper with full author
list*: lacote.pdf
(232 kB, *revised May 14*)

Talk time: Tuesday 22 July,
10:50-11:15 *Paper with full author
list*: marino.pdf
(35 kB, *revised May 21*)

We find this procedure to be flawed since it is myopic. It may be private ly optimal for the parties to mislead the mediator, with the result that the med iation award deviates substantially from the claim's true value. This increases the likelihood the mediation award is rejected, thus increasing the probability of trial. We propose an alternative procedure, under which a party would be liab le for sanctions if, and only if, she deliberately provided false information to the mediator. In our example each party has private information, and the media tor must acquire all his information from the parties. In comparison to the exi sting practice, our procedure has a lower frequency of trial, and provides an ex ante gain to both parties.

Talk time: Tuesday 22 July,
10:50-11:15 *Paper with full author
list*: introSB.txt
(2 kB, *revised June 4*)

The proof uses Ramsey Theorem in order reduce the problem to that of studying properties of epsilon-equilibria in a simple class of stochastic games with finite state space. We also generalize the necessary corollary of Ramsey Theorem to a stochastic setup.

Talk time: Tuesday 22 July,
3:35-4:00 *Paper with full author
list*: shmaya.pdf
(316 kB, *revised June 4*)

Talk time: Thursday 24 July,
3:00-3:25 *Paper with full author
list*: nawar.pdf
(43 kB, *revised June 16*)

Talk time: Wednesday 23 July,
10:50-11:15 *Paper with full author
list*: sentauman.pdf
(248 kB, *revised June 16*)

Talk time: Friday 25 July,
10:50-11:15 *Paper with full author
list*: ADX91.pdf
(641 kB, *revised June 27*)

Talk time: Thursday 24 July,
10:15-10:40 *Paper with full author
list*: congestionjuly3.pdf
(294 kB, *revised July 2*)

Last change: Wed Dec 10 11:48:13 GMT 2003 by Bernhard von Stengel