A group of actors, individuals or firms, can engage in collectively providing projects which may be costly or generating revenues and which may benefit some and harm others. Based on requirements of procedural fairness (Güth and Kliemt, 2013), we derive a bidding mechanism determining...

A group of actors, individuals or firms, can engage in collectively providing projects which may be costly or generating revenues and which may benefit some and harm others. Based on requirements of procedural fairness (Güth and Kliemt, 2013), we derive a bidding mechanism determining...

Many real-life applications of house allocation problems are dynamic. For example, in the case of on-campus housing for college students, each year freshmen apply to move in and graduating seniors leave. Each student stays on campus for a few years only. A student is a "newcomer" in the...

In this paper, we reexamine Eliaz's results (2002) of fault tolerant implementation on one hand and we extend theorems 1 and 2 of Doghmi and Ziad (2008a) to bounded rationality environments, on the other. We identify weak versions of the k-no veto power condition, in conjunction with unanimity...

Different evaluators typically disagree how to rank different candidates since they care more or less for the various qualities of the candidates. It is assumed that all evaluators submit vector bids assigning a monetary bid for each possible rank order. The rules must specify for all possible...

We construct a simple three person trust game with one trustor and two trustees. The trustor has the possibility to either trust both trustees or none, while the trustees make their decisions either sequentially or simultaneously, depending on the treatment. When trustees play sequentially,...