output
20082026
most citedLarge Language Models (LLMs) as Agents for Augmented Democracy

394 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.GTShow all

13 papers · 1 filter

cs.GT2022★ 10 cited

The Complexity of Matching Games: A Survey

Márton Benedek, Péter Biró, Matthew Johnson +2

Matching games naturally generalize assignment games, a well-known class of cooperative games. Interest in matching games has grown recently due to some breakthrough results and ne…

cs.GT2020★ 11 cited

Fairness in penalty shootouts: Is it worth using dynamic sequences?

László Csató, Dóra Gréta Petróczy

The sequence of moves in a dynamic team tournament may distort the ex-ante winning probabilities and harm efficiency. This paper compares seven soccer penalty shootout rules that d…

cs.GT2019★ 2 cited

Estimation of the Shapley value by ergodic sampling

Ferenc Illés, Péter Kerényi

The idea of approximating the Shapley value of an n-person game by Monte Carlo simulation was first suggested by Mann and Shapley (1960) and they also introduced four different heu…

cs.GT2018★ 23 cited

A comparison of penalty shootout designs in soccer

László Csató

Penalty shootout in soccer is recognized to be unfair because the team kicking first in all rounds enjoys a significant advantage. The so-called Catch-Up Rule has been suggested re…

cs.GT2017★ 2 cited

Resource-monotonicity and Population-monotonicity in Connected Cake-cutting

Erel Segal-Halevi, Balázs Sziklai

In the classic cake-cutting problem (Steinhaus, 1948), a heterogeneous resource has to be divided among n agents with different valuations in a proportional way --- giving each age…

cs.GT2017★ 18 cited

Some impossibilities of ranking in generalized tournaments

László Csató

In a generalized tournament, players may have an arbitrary number of matches against each other and the outcome of the games is measured on a cardinal scale with a lower and upper…

cs.GT2016★ 16 cited

An impossibility theorem for paired comparisons

László Csató

In several decision-making problems, alternatives should be ranked on the basis of paired comparisons between them. We present an axiomatic approach for the universal ranking probl…

cs.GT2015★ 29 cited

Monotonicity and Competitive Equilibrium in Cake-cutting

Erel Segal-Halevi, Balázs Sziklai

We study the monotonicity properties of solutions in the classic problem of fair cake-cutting --- dividing a heterogeneous resource among agents with different preferences. Resourc…

cs.GT2015★ 23 cited

A graph interpretation of the least squares ranking method

László Csató

The paper aims at analyzing the least squares ranking method for generalized tournaments with possible missing and multiple paired comparisons. The bilateral relationships may refl…

cs.GT2015★ 1 cited

The Stable Fixtures Problem with Payments

Péter Biró, Walter Kern, Daniël Paulusma +1

We generalize two well-known game-theoretic models by introducing multiple partners matching games, defined by a graph , with an integer vertex capacity function and a…

cs.GT2015

Between plurality and proportionality: an analysis of vote transfer systems

László Csató

The paper considers a general model of electoral systems combining district-based elections with a compensatory mechanism in order to create any outcome between strictly majoritari…

cs.GT2008★ 2 cited

Every hierarchy of beliefs is a type

Miklos Pinter

When modeling game situations of incomplete information one usually considers the players' hierarchies of beliefs, a source of all sorts of complications. Harsányi (1967-68)'s idea…

cs.GT2008★ 1 cited

Young's axiomatization of the Shapley value - a new proof

M. Pinter

We consider Young (1985)'s characterization of the Shapley value, and give a new proof of this axiomatization. Moreover, as applications of the new proof, we show that Young (1985)…