Obvious strategyproofness, bounded rationality and approximation. The case of machine scheduling (Q2292616)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Obvious strategyproofness, bounded rationality and approximation. The case of machine scheduling |
scientific article |
Statements
Obvious strategyproofness, bounded rationality and approximation. The case of machine scheduling (English)
0 references
4 February 2020
0 references
mechanism design
0 references
machine scheduling
0 references
simple mechanisms
0 references
bounded rationality
0 references
lookahead
0 references
