Please use this identifier to cite or link to this item:
https://hdl.handle.net/10419/56902
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Güth, Werner | en |
dc.contributor.author | Levati, M. Vittoria | en |
dc.contributor.author | Ploner, Matteo | en |
dc.date.accessioned | 2010-11-04 | - |
dc.date.accessioned | 2012-04-11T09:31:13Z | - |
dc.date.available | 2012-04-11T09:31:13Z | - |
dc.date.issued | 2010 | - |
dc.identifier.uri | http://hdl.handle.net/10419/56902 | - |
dc.description.abstract | Bidding rules that guarantee procedural fairness may induce more equilibrium bidding and moderate other-regarding concerns. In our experiment, we assume commonly known true values and only two bidders to implement a best-case scenario for other-regarding concerns. The two-by-two factorial design varies ownership of the single indivisible commodity (an outside seller versus collective ownership) and the price rule (fist versus second price). Our results indicate more equilibrium behavior under the procedurally fair price rule, what, however, does not completely crowd out equality and efficiency seeking. | en |
dc.language.iso | eng | en |
dc.publisher | |aFriedrich Schiller University Jena and Max Planck Institute of Economics |cJena | en |
dc.relation.ispartofseries | |aJena Economic Research Papers |x2010,073 | en |
dc.subject.jel | D44 | en |
dc.subject.jel | C92 | en |
dc.subject.ddc | 330 | en |
dc.subject.keyword | auctions | en |
dc.subject.keyword | fair division games | en |
dc.subject.keyword | procedural fairness | en |
dc.subject.stw | Auktionstheorie | en |
dc.subject.stw | Gerechtigkeit | en |
dc.subject.stw | Soziale Beziehungen | en |
dc.subject.stw | Crowding out | en |
dc.subject.stw | Test | en |
dc.title | Does procedural fairness crowd out other-regarding concerns? A bidding experiment | - |
dc.type | Working Paper | en |
dc.identifier.ppn | 638482151 | en |
dc.rights | http://www.econstor.eu/dspace/Nutzungsbedingungen | en |
Files in This Item:
Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.