"Characterizing incentive compatible, Pareto optimal and sufficiently ..."

Rica Gonen, Anat Lerner (2017)

> Home

Details and statistics

DOI: 10.3233/COM-160064

access: closed

type: Journal Article

metadata version: 2020-09-24

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/computability/GonenL17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computability/GonenL17
Rica Gonen, Anat Lerner:
Characterizing incentive compatible, Pareto optimal and sufficiently anonymous constrained combinatorial mechanisms - Two players case. Comput. 6(2): 183-208 (2017)

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.