default search action
SIGecom Exchanges, Volume 14
Volume 14, Number 1, June 2015
- Shaddin Dughmi, Vasilis Gkatzelis, Jason D. Hartline:
SIGecom job market candidate profiles 2016. 2-40 - Constantinos Daskalakis:
Multi-item auctions defying intuition? 41-75 - Siddharth Barman, Katrina Ligett:
Finding any nontrivial coarse correlated equilibrium is hard. 76-79 - Christopher P. Chambers, Nicolas S. Lambert:
Introduction to dynamic belief elicitation. 80-83 - Richard Cole, Vasilis Gkatzelis:
Approximating the nash social welfare with indivisible items. 84-88 - David A. Easley, Arpita Ghosh:
Behavioral mechanism design: optimal crowdsourcing contracts and prospect theory. 89-94 - Tomasz P. Michalak, Talal Rahwan, Stefano Moretti, Ramasuri Narayanam, Oskar Skibski, Piotr L. Szczepanski, Michael J. Wooldridge:
A new approach to measure social capital using game-theoretic techniques. 95-100 - Aaron Roth, Jonathan R. Ullman, Zhiwei Steven Wu:
Watch and learn: optimizing from revealed preferences feedback. 101-104 - Vasilis Syrgkanis:
Algorithmic game theory and econometrics. 105-108
Volume 14, Number 2, December 2015
- Sam Ganzfried:
Reflections on the first man vs. machine no-limit Texas hold 'em competition. 2-15 - Haris Aziz, Serge Gaspers, Simon Mackenzie, Toby Walsh:
Two desirable fairness concepts for allocation of indivisible objects under ordinal preferences. 16-21 - Paul Dütting, Thomas Kesselheim, Éva Tardos:
Algorithms as mechanisms: the price of anarchy of relax-and-round. 22-25 - Chien-Ju Ho, Aleksandrs Slivkins, Siddharth Suri, Jennifer Wortman Vaughan:
Incentivizing high quality crowdwork. 26-34 - Tim Roughgarden, Inbal Talgam-Cohen:
Why prices need algorithms. 35-40 - Aviad Rubinstein:
The complexity of simplicity in mechanism design. 41-43
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.