Complementary to the axiomatic and mechanism design studies on queueing problems, this paper proposes a strategic bargaining approach to resolve queueing conflicts. Given a situation where players with different waiting costs have to form a queue in order to be served, they firstly compete with...

This paper considers a resource allocation mechanism that utilizes a profit-maximizing auctioneer/matchmaker in the Kelso–Crawford (1982) (many-to-one) assignment problem. We consider general and simple (individualized price) message spaces for firmsʼ reports following Milgrom (2010). We show...

This report provides a conceptual foundation for the analysis of international regulatory co-operation (IRC) and its potential benefits through reduced trade costs. Different forms of IRC aiming to reduce specification, conformity assessment and information costs - which can arise from...

This chapter surveys a sizable and growing literature on coalition formation. We refer to theories in which one or more groups of agents (“coalitionsâ€) deliberately get together to jointly determine within-group actions, while interacting noncooperatively across groups. The chapter...

This study considers waiting times for populations to achieve efficient social coordination. Belloc and Bowles [1] conjecture that coalitional behavior will hasten such coordination. This turns out to be true when every member of the population interacts with every other member, but does not...

This paper considers marriage problems, roommate problems with nonempty core, and college admissions problems with responsive preferences. All stochastically stable matchings are shown to be contained in the set of matchings which are most robust to one-shot deviation.

This work makes an attempt at theoretical summary of the major issues related to the essence, types, forms and procedures applied for resolving of collective bargain disputes and the major goals and principles of the negotiations intended for dispute resolving. The work gives reason to the...

The deferred acceptance algorithm proposed by Gale and Shapley (1962) has had a profound influence on market design, both directly, by being adapted into practical matching mechanisms, and, indirectly, by raising new theoretical questions. Deferred acceptance algorithms are at the basis of a...