7 citations · 11 across the 11 of their papers we have counts for
14 papers
PHRBench: A Behavioral Evaluation of Post-Hallucination Reasoning in LLMs
Linghao Meng, Feng He, Xuan Yang +5
Hallucinated information can propagate through multi-stage LLM systems and become part of the context for subsequent reasoning. Existing studies of post-hallucination reasoning (PH…
A 1.283 Price-of-Anarchy Bound for the Repeated Virtual First-Price Auction
Endre Csóka
We study the repeated allocation of a single indivisible resource among strategic players. Each player has a privately known value distribution , and values are drawn…
Moser-Tardos Algorithm with small number of random bits
Endre Csóka, Łukasz Grabowski, András Máthé +2
We study a variant of the parallel Moser-Tardos Algorithm. We prove that if we restrict attention to a class of problems whose dependency graphs have subexponential growth, then th…
A Robust Efficient Dynamic Mechanism
Endre Csóka
Athey and Segal introduced an efficient budget-balanced mechanism for a dynamic stochastic model with quasilinear payoffs and private values, using the solution concept of perfect…
Towards solving the 7-in-a-row game
Domonkos Czifra, Endre Csóka, Zsolt Zombori +1
Our paper explores the game theoretic value of the 7-in-a-row game. We reduce the problem to solving a finite board game, which we target using Proof Number Search. We present a nu…
On directed analogues of expander and hyperfinite graph sequences
Endre Csóka, Łukasz Grabowski
We introduce and study analogues of expander and hyperfinite graph sequences in the context of directed acyclic graphs, which we call "extender" and "hypershallow" graph sequences,…
Upper bounds for the necklace folding problems
Endre Csóka, Zoltán L. Blázsik, Zoltán Király +1
A necklace can be considered as a cyclic list of red and blue beads in an arbitrary order, and the goal is to fold it into two and find a large cross-free matching of pairs…
Locally common graphs
Endre Csóka, Tamás Hubai, László Lovász
Goodman proved that the sum of the number of triangles in a graph on nodes and its complement is at least ; in other words, this sum is minimized, asymptotically, by a…
Entropy and expansion
Endre Csóka, Viktor Harangi, Bálint Virág
Shearer's inequality bounds the sum of joint entropies of random variables in terms of the total joint entropy. We give another lower bound for the same sum in terms of the individ…
Some Epistemic Extensions of Gödel Fuzzy Logic
D. Dastgheib, H. Farahani, A. H. Sharafi
In this paper we prove soundness and completeness of some epistemic extensions of Gödel fuzzy logic, based on Kripke models in which both propositions at each state and accessibili…
A conjecture about the efficiency of first price mechanisms
Endre Csóka
We present different versions of a conjecture which would express that first price mechanisms never work very badly in a very general class of problems. The definitions include mos…
The solution to an open problem for a caching game
Endre Csóka, Thomas Lidbetter
In a caching game introduced by Alpern et al., a Hider who can dig to a total fixed depth normalized to buries a fixed number of objects among discrete locations. A Searche…
Limit theory of discrete mathematics problems
Endre Csóka
We show a general problem-solving tool called limit theory. This is an advanced version of asymptotic analysis of discrete problems when some finite parameter tends to infinity. We…
Efficient Teamwork
Endre Csóka
Our goal is to solve both problems of adverse selection and moral hazard for multi-agent projects. In our model, each selected agent can work according to his private "capability t…