English
Related papers

Related papers: Satisfactory Budget Division

200 papers

Scaling test-time computation improves performance across different tasks on large language models (LLMs), which has also been extended to tool-augmented agents. For these agents, scaling involves not only "thinking" in tokens but also…

How to optimally persuade an agent who has a private type? When elicitation is feasible, this amounts to a fairly standard principal-agent-style mechanism design problem, where the persuader employs a mechanism to first elicit the agent's…

Computer Science and Game Theory · Computer Science 2024-11-01 Jiarui Gan , Abheek Ghosh , Nicholas Teh

In this paper we consider two problems regarding the scheduling of available personnel in order to perform a given quantity of work, which can be arbitrarily decomposed into a sequence of activities. We are interested in schedules which…

Data Structures and Algorithms · Computer Science 2013-01-22 Mugurel Ionut Andreica , Romulus Andreica , Angela Andreica

The budget is the key means for effecting policy in democracies, yet its preparation is typically an excluding, opaque, and arcane process. We aim to rectify this by providing for the democratic creation of complete budgets --- for…

Computer Science and Game Theory · Computer Science 2018-06-21 Ehud Shapiro , Nimrod Talmon

We study the problem of computing maximin share guarantees, a recently introduced fairness notion. Given a set of $n$ agents and a set of goods, the maximin share of a single agent is the best that she can guarantee to herself, if she would…

Computer Science and Game Theory · Computer Science 2018-06-12 Georgios Amanatidis , Evangelos Markakis , Afshin Nikzad , Amin Saberi

The paper designs revenue-maximizing auction mechanisms for agents who aim to maximize their total obtained values rather than the classical quasi-linear utilities. Several models have been proposed to capture the behaviors of such agents…

Computer Science and Game Theory · Computer Science 2023-07-11 Pinyan Lu , Chenyang Xu , Ruilong Zhang

We study principal-agent problems in which a principal commits to an outcome-dependent payment scheme (a.k.a. contract) so as to induce an agent to take a costly, unobservable action. We relax the assumption that the principal perfectly…

Computer Science and Game Theory · Computer Science 2021-06-02 Matteo Castiglioni , Alberto Marchesi , Nicola Gatti

We consider allocating indivisible goods with provable fairness guarantees that are satisfied regardless of which bundle of items each agent receives. Symmetrical allocations of this type are known to exist for divisible resources, such as…

Computer Science and Game Theory · Computer Science 2024-06-21 Connor Johnston , Aleksandr M. Kazachkov

We consider an online resource allocation problem where multiple resources, each with an individual initial capacity, are available to serve random requests arriving sequentially over multiple discrete time periods. At each time period, one…

Optimization and Control · Mathematics 2020-12-21 Jiashuo Jiang , Jiawei Zhang

The revenue maximization problem of service provider is considered and different pricing schemes to solve the above problem are implemented. The service provider can choose an apt pricing scheme subjected to limited resources, if he knows…

Networking and Internet Architecture · Computer Science 2014-03-13 Aditya Goyal , Akanksha Tyagi , Manisha Bhende , Swapnil Kawade

Logics for resource-bounded agents have been getting more and more attention in recent years since they provide us with more realistic tools for modelling and reasoning about multi-agent systems. While many existing approaches are based on…

Logic in Computer Science · Computer Science 2024-01-25 Vitaliy Dolgorukov , Rustam Galimullin , Maksim Gladyshev

A new class of multi agent single machine scheduling problems is introduced, where each job is associated with a self interested agent with a utility function decreasing in completion time. We aim to achieve a fair solution by maximizing…

Computer Science and Game Theory · Computer Science 2026-04-01 Gaia Nicosia , Andrea Pacifici , Ulrich Pferschy

We revisit the discrete heterogeneous two-facility location problem, in which there is a set of agents that occupy nodes of a line graph, and have private approval preferences over two facilities. When the facilities are located at some…

Computer Science and Game Theory · Computer Science 2021-09-10 Panagiotis Kanellopoulos , Alexandros A. Voudouris , Rongsen Zhang

To successfully complete a complex project, be it a construction of an airport or of a backbone IT system, agents (companies or individuals) must form a team having required competences and resources. A team can be formed either by the…

Computer Science and Game Theory · Computer Science 2016-09-16 Piotr Skowron , Krzysztof Rzadca , Anwitaman Datta

We analyze a two-period principal-agent model in which the principal faces a budget constraint, and the agent's private costs of performing tasks across the two periods may be correlated. We examine the optimal design of the reward scheme…

Optimization and Control · Mathematics 2025-12-30 Eilon Solan , Avraham Tabbach , Chang Zhao

Participatory budgeting (PB) has attracted much attention in recent times due to its wide applicability in social choice settings. In this paper, we consider indivisible PB which involves allocating an available, limited budget to a set of…

Computer Science and Game Theory · Computer Science 2022-07-19 Gogulapati Sreedurga , Yadati Narahari

We propose a multi-agent model of an asset market and study conditions that guarantee that the strategy of an individual agent cannot outperform the market. The model assumes a mean-field approximation of the market by considering an…

Mathematical Finance · Quantitative Finance 2022-11-11 Mikhail Zhitlukhin

Participatory budgeting refers to the practice of allocating public resources by collecting and aggregating individual preferences. Most existing studies in this field often assume an additive utility function, where each individual holds a…

Computer Science and Game Theory · Computer Science 2024-06-21 Jing Yuan , Shaojie Tang

In this paper, we consider the revealed preferences problem from a learning perspective. Every day, a price vector and a budget is drawn from an unknown distribution, and a rational agent buys his most preferred bundle according to some…

Computer Science and Game Theory · Computer Science 2012-11-20 Morteza Zadimoghaddam , Aaron Roth

We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common economic situations, and yet it has not been studied, to our…

Computer Science and Game Theory · Computer Science 2013-12-02 Yaron Singer