Daniel Monte
Names
| first: | Daniel |
| last: | Monte |
Identifer
| RePEc Short-ID: | pmo511 |
Contact
| email: | daniel.monte at domain unito.it |
| homepage: | https://sites.google.com/site/dma33danielmonte/ |
| phone: | +393311502966 |
| postal address: | Via Cavour 8 Torino, 10123 |
Affiliations
-
Università degli Studi di Torino
/ Dipartimento di Scienze Economico-Sociali e Matematico-Statistiche
- EDIRC entry
- location:
Research profile
author of:
- The Daycare Assignment Problem (RePEc:aah:aarhec:2011-05)
by John Kennes & Daniel Monte & Norovsambuu Tumennasan - Centralized Allocation in Multiple Markets (RePEc:aah:aarhec:2012-09)
by Daniel Monte & Norovsambuu Tumennasan - Matching with Quorums (RePEc:aah:aarhec:2012-10)
by Daniel Monte & Norovsambuu Tumennasan - The Day Care Assignment: A Dynamic Matching Problem (RePEc:aea:aejmic:v:6:y:2014:i:4:p:362-406)
by John Kennes Jr. & Daniel Monte Jr. & Norovsambuu Tumennasan Jr. - A Theory of Credibility under Commitment (RePEc:bpj:bejtec:v:10:y:2010:i:1:n:33)
by Monte Daniel - Matching with quorums (RePEc:eee:ecolet:v:120:y:2013:i:1:p:14-17)
by Monte, Daniel & Tumennasan, Norovsambuu - Learning with bounded memory in games (RePEc:eee:gamebe:v:87:y:2014:i:c:p:204-223)
by Monte, Daniel - Bounded memory and permanent reputations (RePEc:eee:mateco:v:49:y:2013:i:5:p:345-354)
by Monte, Daniel - Centralized allocation in multiple markets (RePEc:fgv:eesptd:322)
by Monte, Daniel & Tumennasan, Norovsambuu - Costly Information Intermediation as a Natural Monopoly (RePEc:fip:fedcwp:1721)
by Daniel Monte & Roberto Pinheiro - Costly Information Intermediation as a Natural Monopoly (RePEc:fip:fedcwq:172101)
by Daniel Monte & Roberto Pinheiro - Oligopsonies over the Business Cycle (RePEc:fip:fedcwq:87536)
by Daniel Monte & Roberto Pinheiro - Learning in hidden Markov models with bounded memory (RePEc:pra:mprapa:23854)
by Monte, Daniel & Said, Maher - The value of (bounded) memory in a changing world (RePEc:spr:joecth:v:56:y:2014:i:1:p:59-82)
by Daniel Monte & Maher Said - Incentive constraints in games with bounded memory (RePEc:spr:jogath:v:43:y:2014:i:1:p:137-143)
by Daniel Monte