Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games

DOI10.1007/978-3-642-05284-2_12zbMath1184.68037OpenAlexW2118916428MaRDI QIDQ3556623

Loukas Lazos, William Kozma

Publication date: 24 April 2010

Published in: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-05284-2_12

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Decision theory for games (91A35)

Related Items (2)

Perfect strategies for the Ulam-Rényi game with multi-interval questions ⋮ On the multi-interval Ulam-Rényi game: for 3 lies 4 intervals suffice

Uses Software

• SPINS
• TinyECC

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Detecting errors in searching games
• Coping with errors in binary search procedures
• SPINS: Security protocols for sensor networks
• Three Thresholds for a Liar
• Network Applications of Bloom Filters: A Survey
• Space/time trade-offs in hash coding with allowable errors

This page was built for publication: Dealing with Liars: Misbehavior Identification via Rényi-Ulam Games