The following pages link to Jing Chen (Q417638):
Displayed 25 items.
- Collusive dominant-strategy truthfulness (Q417640) (← links)
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions (Q725051) (← links)
- A new framework for the design and analysis of identity-based identification schemes (Q955014) (← links)
- Information elicitation for Bayesian auctions (Q1617641) (← links)
- Efficient rational proofs with strong utility-gap guarantees (Q1617659) (← links)
- Maximal information propagation via lotteries (Q2152141) (← links)
- Mechanism design with possibilistic beliefs (Q2253833) (← links)
- The robustness of zero-determinant strategies in iterated prisoner's dilemma games (Q2415596) (← links)
- Algorand: a secure and efficient distributed ledger (Q2422025) (← links)
- Bayesian auctions with efficient queries (Q2667811) (← links)
- Optimal Provision-After-Wait in Healthcare (Q2800379) (← links)
- Auction Revenue in the General Spiteful-Utility Model (Q2800566) (← links)
- Rational Proofs with Multiple Provers (Q2800569) (← links)
- Crowdsourced Bayesian auctions (Q2826060) (← links)
- Critical path for an optimal hedging strategy (Q2869158) (← links)
- Truthful Multi-unit Procurements with Budgets (Q2936978) (← links)
- A More Natural Way to Construct Identity-Based Identification Schemes (Q3612389) (← links)
- The order independence of iterated dominance in extensive games (Q4586119) (← links)
- Tight Revenue Bounds With Possibilistic Beliefs and Level-k Rationality (Q4614300) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
- Brief Announcement: Bayesian Auctions with Efficient Queries. (Q5002792) (← links)
- (Q5075766) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q5111340) (← links)
- A new approach to auctions and resilient mechanism design (Q5172745) (← links)
- Mechanism Design with Set-Theoretic Beliefs (Q5495008) (← links)