Navigation auf uzh.ch
Navigation auf uzh.ch
If you want to provide an example treatment, send the material to Urs Fischbacher.
| Blinking Text Sample Treatment by Wendy Lee Screenshot Demonstrates the use of the later command. |
|
| Switching Screens Sample Treatment by Stefan Palan Screenshot Demonstrates how pop-up menus or switching between different views/screens/markets can be implemented. |
Demo_SwitchScreen.zip |
| GIMS - A Powerful Market Software by Stefan Palan Screenshot A very versatile treatment for implementing asset markets, including call auction (with the NASDAQ clearing mechanism) and continuous double auction, and offering numerous options and parameters. GIMS is open source and comes with comprehensive documentation. |
GIMS Homepage |
| Call Auction Treatment by Stefan Palan Screenshot Demonstrates how to program a call auction that sets the price to maximize turnover. Please consider GIMS (listed above) for a much better market software including call auction functionality. |
Demo_CallAuction.ztt |
| Data Input and Output Into Files Sample Treatment by Stefan Palan Screenshot Demonstrates how to write data to, and read data from, a file into a table in z-Tree. |
Demo_DataFileRW.zip |
| Going back and forth within one stage by Sabine Kröger Screenshot Demonstrates how participants can go back and forth within a stage using overlapping container boxes. This is a solution proposed by Urs Fischbacher for a problem that I once I had. I wanted to share it here. |
|
| Arrange text in a pie chart by Max Brixner Screenshot Demonstrates how to automatically arrange text in a pie chart by trigonometric calculations. |
|
| Image Counter by Ali Seyhun Saral Screenshot Demonstrates how to create an image counter by using later command and multimedia box. |
|
| Beauty Contest by Stefan Palan Screenshot Demonstrates how to program a simple beauty contest experiment. |
Demo_BeautyContest.zip |
| Dutch Auction with Experimenter Subject by Stefan Palan Screenshot Demonstrates how to use the later command to program a Dutch auction and how to include an experimenter subject, who sees some summary information on his/her scrren. |
Demo_DutchAuction.zip |
| Continuous Double Auction Market with Full Execution of Multiple Unit Orders by Stefan Palan Screenshot Demonstrates how to program a continuous double auction market which permits the entry of multi-unit bids and asks and the full execution of orders. This demo treatment does not feature the possibility of partially executing trades. It does however include several simple feasibility checks (budget constraints, bid-ask improvement rule, no churning) as well as a box displaying the history of traded orders, cancelled orders, invalidated orders and expired orders (order expiry is not yet implemented in the example, but is prepared for). Please consider GIMS (listed earlier) for a much better market software including continuous double auction functionality. |
Demo_CDA_FullExecution.zip |
| Treatment: Extra Stage(s) Run Only When Experimenter Calls for a Final Period by Ron Harstad Screenshot In many situations, you might wish to have stages in a treatment that are only done in the final period, and also to decide as the experiment is running which period will be the final one. In a voluntary-contributions treatment, for example, you may wish to announce that this is the final period, without committing yourself before the treatment begins to a particular number of periods. In the project that led me to write this simple treatment, it is not readily predictable how many periods I can run in a given time frame, yet I want to introduce one-time additional procedures for the final period. The treatment calls for the experimenter to login a zleaf window for her/himself AFTER all subjects are logged in. That window simply asks at the beginning of each period for the experimenter to click a box if this is to be the final period (else, do nothing). |
|
| Random permutation program by Eli Spiegelman The question of how to put a set of options into a random order has come up a couple of times recently, so I thought I might contribute the method I have to this website. |
|
| Dynamic Experiments for Estimating Preferences [DEEP] method by Filip Fidanoski and Timothy Johnson | paper code |
