Non-cooperative computation: Boolean functions with correctness and exclusivity (Q2570128): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q2783476 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4902563 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate common knowledge and co-ordination: Recent lessons from game theory / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4220396 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Arrow's theorem and the Gibbard-Satterthwaite theorem: A unified approach / rank | |||
Normal rank | |||
Latest revision as of 16:58, 10 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Non-cooperative computation: Boolean functions with correctness and exclusivity |
scientific article |
Statements
Non-cooperative computation: Boolean functions with correctness and exclusivity (English)
0 references
26 October 2005
0 references
Non-cooperative computation
0 references
Informational mechanism design
0 references
Cryptography
0 references
