An Efficient Algorithm for Testing Epsilon-Approximate Core Membership in Negotiation Games

Bodwin, Gregory M.

We study a game theoretic model of many-party negotiations, in which each player can perform work that benefits the rest of the group. We examine the core of the game, which is the set of potential outcomes that leave no group of negotiators with an incentive to break from the agreement and pick a new outcome. More specically, we are interested in whether or not core membership of an ... read more

This object is in collection:
Undergraduate honors theses
Senior honors thesis
Department of Computer Science
Permanent URL
ID: tufts:UA005.036.010.00001
To Cite: DCA Citation Guide
Usage: Detailed Rights