[Cs5500] CS 5500 Doubt about tournaments and claim

[Karl Lieberherr]

Hi Mohinish:

we have a huge number of claims k(c), where c is any rational number
between 0 and 1.

In the sense of the gentlemen agreement, I would not offer the same
claim again but make c a little different with the goal to converge on
the optimal c.

What do you mean by claim set? The welfare set of claims that have
been agreed upon by two parties? In our case there should ideally by
just one
element in the welfare set if the avatars play optimally.

-- Karl

On Sat, Sep 24, 2011 at 5:43 PM, Mohinish Vinnakota
<vinnakota.m at husky.neu.edu> wrote:
> Hi Prof. Karl,
> We were designing an intelligent avatar for MMG problem 1 of ps2.
> When we are playing: To my understanding, there would be a tournament and
> there will be n games between teams, 2 at a time.
> So in game 1 (team1 vs team3), team1 claims a value of 'c' and it goes to
> Claim set.
> In game 2, suppose team2 tries to propose the same value of 'c', whether it
> should not be allowed to do or is it ok, meaning that whether the ClaimSet's
> life is for tournament or per game.
> Thank You!
> Mohinish Vinnakota
>
>