The Core of Directed Network Problems with Quotas
| dc.creator | Lahiri, Somdeb | |
| dc.date | 2004-08-28 | |
| dc.date | 2004-09-11 | |
| dc.date.accessioned | 2026-07-07T03:21:43Z | |
| dc.date.available | 2026-07-07T03:21:43Z | |
| dc.description | This paper proves the existence of non-empty cores for directed network problems with quotas and for those combinatorial allocation problems which permit only exclusive allocations. | |
| dc.description | 6 pages, 0 figures, source file: MS Word; definitions of the feasible allocations have been strengthened; examples provided; network obtained by the procedure can be decentralized | |
| dc.identifier | https://arxiv.org/abs/cs/0408065 | |
| dc.identifier | http://arxiv.org/abs/cs/0408065 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/32314 | |
| dc.subject | Computer Science and Game Theory | |
| dc.title | The Core of Directed Network Problems with Quotas | |
| dc.type | text |