"Concise Representations and Complexity of Combinatorial Assignment Problems."

Fredrik Präntare, George Osipov, Leif Eriksson (2022)

> Home

Details and statistics

DOI: 10.5555/3535850.3536086

access: open

type: Conference or Workshop Paper

metadata version: 2022-07-18

- view
  - electronic edition @ ifaamas.org (open access)
  - electronic edition @ acm.org
  authority control:
- export record
  dblp key:
  - conf/atal/PrantareOE22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/atal/PrantareOE22
Fredrik Präntare, George Osipov, Leif Eriksson:
Concise Representations and Complexity of Combinatorial Assignment Problems. AAMAS 2022: 1714-1716

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.