The plea bargaining procedure, namely the viability of a stage of bargaining between prosecutor and defendant in criminal suits, is analyzed in the framework of a two-sided incomlete information game.

The authors investigates refinements of two solutions, the saddle and the weak saddle, defined by Shapley (1964) for two-player zero-sum games. Applied to weak tournaments, the firsy refinement, the mixed saddle, is unique and gives us a new solution, generally lying between the GETCHA and...

In this paper, I first prove an integral representation theorem: Every quasi-integral on a Stone lattice can be represented by a unique upper-continuous capacity. I then apply this representation theorem to study the topological structure of the space of all upper-continuous capacities on a...

This paper explains how the Gibbs sampler can be used to perform Bayesian inference on GARCH models. Although the Gibbs sampler is usually based on the analytical knowledge of the full conditional posterior densities, such knowledge is not available in regression models with GARCH errors. We...

A profit maximising auctioneer can provide a public good to a group of agents. Each group member has a private value for the good being provided to the group. We investigate an auction mechanism where the auctioneer provides the good to the group, only if the sum of their bids exceeds a reserve...

A profit-maximizing auctioneer can provide a public good to at most one of a number of groups of agents. The groups may have non-empty intersections. Each group member has a private value for the good being provided to the group. We investigate an auction mechanism where the auctioneer provides...

In this paper we decribe a hybrid strategy for solving combinatorial optimisation problemms, obtained by coupling a local search method to an evolutionary algorithm, and we provide an application to the Manhattan newspaper problem. The local search method has been devised specifically for this...