Game-theoretically secure protocols for the ordinal random assignment problem

DOI10.1007/978-3-031-33491-7_22zbMATH Open1542.94113MaRDI QIDQ6535137

Ting Wen, T.-H. Hubert Chan, Hao Xie, Quan Xue

Publication date: 10 November 2023

zbMATH Keywords

distributed protocolsordinal assignment problemgame-theoretic security

Mathematics Subject Classification ID

Cryptography (94A60) Distributed algorithms (68W15) Algorithmic game theory and complexity (91A68)

Cites Work

• Game theoretic notions of fairness in multi-party coin toss
• Bitcoin as a transaction ledger: a composable treatment
• Game-theoretic fairness meets multi-party protocols: the case of leader election
• On a conjecture by Gale about one-sided matching problems
• The Complexity of Computing the Random Priority Allocation Matrix
• Bounded-concurrent secure multi-party computation with a dishonest majority
• The Impossibility of Bayesian Group Decision Making with Separate Aggregation of Beliefs and Values
• Assignment Problem Based on Ordinal Preferences
• Random Serial Dictatorship and the Core from Random Endowments in House Allocation Problems
• Constant-Round Nonmalleable Commitments from Any One-Way Function
• A new solution to the random assignment problem.

Related Items (1)

Title not available (Why is that?)

This page was built for publication: Game-theoretically secure protocols for the ordinal random assignment problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535137)