English
Related papers

Related papers: Extractive contest design

200 papers

We study the problem of fairly allocating a set of chores to a group of agents. The existence of envy-free up to any item (EFX) allocations is a long-standing open question for both goods and chores. We resolve this question by providing a…

Computer Science and Game Theory · Computer Science 2024-06-18 Vasilis Christoforidis , Christodoulos Santorinaios

I postulate that human or other intelligent agents function or should function as follows. They store all sensory observations as they come - the data is holy. At any time, given some agent's current coding capabilities, part of the data is…

Artificial Intelligence · Computer Science 2007-09-06 Juergen Schmidhuber

Abductive explanations (AXp's) are widely used for understanding decisions of classifiers. Existing definitions are suitable when features are independent. However, we show that ignoring constraints when they exist between features may lead…

Artificial Intelligence · Computer Science 2024-09-19 Martin Cooper , Leila Amgoud

In this paper equilibrium measures in the presence of external fields created by fixed charges are analyzed. These external fields are a particular case of the so-called rational external fields (in the sense that their derivatives are…

Complex Variables · Mathematics 2016-05-09 Ramon Orive , Joaquin F. Sanchez Lara

Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…

Artificial Intelligence · Computer Science 2018-06-05 Jasper De Bock , Gert de Cooman

Concept-based interpretability methods offer a lens into the internals of foundation models by decomposing their embeddings into high-level concepts. These concept representations are most useful when they are compositional, meaning that…

Computation and Language · Computer Science 2024-06-27 Adam Stein , Aaditya Naik , Yinjun Wu , Mayur Naik , Eric Wong

This paper deals with an extension of the concept of correlated strategies to Markov stopping games. The Nash equilibrium approach to solving nonzero-sum stopping games may give multiple solutions. An arbitrator can suggest to each player…

Optimization and Control · Mathematics 2020-11-23 David M. Ramsey , Krzysztof Szajowski

We study the computational complexity of Nash equilibria in concurrent games with limit-average objectives. In particular, we prove that the existence of a Nash equilibrium in randomised strategies is undecidable, while the existence of a…

Computer Science and Game Theory · Computer Science 2011-09-29 Michael Ummels , Dominik Wojtczak

The fundamental tension between availability and consistency shapes the design of distributed storage systems. Classical results capture extreme points of this trade-off: the CAP theorem shows that strong models like linearizability…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-10-29 Hagit Attiya , Constantin Enea , Enrique Román-Calvo

A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. If we consider the objects as indivisible, many instances of the decision problem: ``Is there a fair division of the objects…

Computer Science and Game Theory · Computer Science 2025-07-03 Samuel Bismuth , Ivan Bliznets , Erel Segal-Halevi

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 most of the problems where there is a principal (seller) who…

Economics · Quantitative Finance 2015-09-01 Endre Csóka

We study the problem of fair division when the resources contain both divisible and indivisible goods. Classic fairness notions such as envy-freeness (EF) and envy-freeness up to one good (EF1) cannot be directly applied to the mixed goods…

Computer Science and Game Theory · Computer Science 2021-01-28 Xiaohui Bei , Zihao Li , Jinyan Liu , Shengxin Liu , Xinhang Lu

We consider the problem of payoff division in indivisible coalitional games, where the value of the grand coalition is a natural number. This number represents a certain quantity of indivisible objects, such as parliamentary seats, kidney…

Computer Science and Game Theory · Computer Science 2026-04-02 Mikołaj Czarnecki , Michał Korniak , Oskar Skibski , Piotr Skowron

We study markets of indivisible items in which price-based (Walrasian) equilibria often do not exist due to the discrete non-convex setting. Instead we consider Nash equilibria of the market viewed as a game, where players bid for items,…

Computer Science and Game Theory · Computer Science 2011-03-22 Avinatan Hassidim , Haim Kaplan , Yishay Mansour , Noam Nisan

The all-pay auction, a classic competitive model, is widely applied in scenarios such as political elections, sports competitions, and research and development, where all participants pay their bids regardless of winning or losing. However,…

Theoretical Economics · Economics 2025-07-24 Yan Liu , Ying Qin , Zihe Wang

We consider a sequential inspection game where an inspector uses a limited number of inspections over a larger number of time periods to detect a violation (an illegal act) of an inspectee. Compared with earlier models, we allow varying…

Computer Science and Game Theory · Computer Science 2016-08-24 Bernhard von Stengel

Assume that a treasure is placed in one of $M$ boxes according to a known distribution and that $k$ searchers are searching for it in parallel during $T$ rounds. We study the question of how to incentivize selfish players so that the…

Computer Science and Game Theory · Computer Science 2020-06-23 Amos Korman , Yoav Rodeh

For given multivariate functions specified by algebraic, differential or difference equations, the separability problem is to decide whether they satisfy linear differential or difference equations in one variable. In this paper, we will…

Symbolic Computation · Computer Science 2021-02-09 Shaoshi Chen , Ruyong Feng , Pingchuan Ma , Michael F. Singer

In resource contribution games, a class of non-cooperative games, the players want to obtain a bundle of resources and are endowed with bags of bundles of resources that they can make available into a common for all to enjoy. Available…

Computer Science and Game Theory · Computer Science 2024-04-01 Nicolas Troquard

We investigate the efficiency of fair allocations of indivisible goods using the well-studied price of fairness concept. Previous work has focused on classical fairness notions such as envy-freeness, proportionality, and equitability.…

Computer Science and Game Theory · Computer Science 2021-09-08 Xiaohui Bei , Xinhang Lu , Pasin Manurangsi , Warut Suksompong
‹ Prev 1 8 9 10 Next ›