Game-theoretically secure protocols for the ordinal random assignment problem

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

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

Publication date: 10 November 2023

Recommendations

• A solution to the random assignment problem on the full preference domain
• A new solution to the random assignment problem.
• An equilibrium analysis of the probabilistic serial mechanism
• A simple random assignment problem with a unique solution
• Random assignments with uniform preferences: an impossibility result

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

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

Cited In (2)

• Title not available (Why is that?)
• 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)