1

December 2017
ACM Transactions on Economics and Computation (TEAC) - Special Issue on Wine'15: Volume 5 Issue 4, December 2017

**Publisher:** ACM

**Bibliometrics**:

Citation Count: 0

Downloads (6 Weeks): 20, Downloads (12 Months): 20, Downloads (Overall): 20

Full text available:

PDF
The Stackelberg equilibrium is a solution concept that describes optimal strategies to commit to: Player 1 ( the leader ) first commits to a strategy that is publicly announced, then Player 2 ( the follower ) plays a best response to the leader’s choice. We study the problem of computing ...

**Keywords**:
Algorithmic game theory, Extensive-Form Correlated Equilibrium, extensive-form games, finite sequential games, stackelberg equilibrium

2

December 2015
WINE 2015: Proceedings of the 11th International Conference on Web and Internet Economics - Volume 9470

**Publisher:** Springer-Verlag New York, Inc.

The Stackelberg equilibrium is a solution concept that describes optimal strategies to commit to: Playerï��1 the leader first commits to a strategy that is publicly announced, then Playerï��2 the follower plays a best response to the leader's choice. We study Stackelberg equilibria in finite sequential i.e., extensive-form games and provide ...

3

July 2015
IJCAI'15: Proceedings of the 24th International Conference on Artificial Intelligence

**Publisher:** AAAI Press

We consider discrete protocols for the classical Steinhaus cake cutting problem. Under mild technical conditions, we show that any deterministic strategy-proof protocol for two agents in the standard Robertson-Webb query model is dictatorial, that is, there is a fixed agent to which the protocol allocates the entire cake. For n ...

4

August 2014
Theory of Computing Systems: Volume 55 Issue 2, August 2014

**Publisher:** Springer-Verlag New York, Inc.

Two standard algorithms for approximately solving two-player zero-sum concurrent reachability games are value iteration and strategy iteration . We prove upper and lower bounds of $2^{m^{\varTheta(N)}}$ on the worst case number of iterations needed by both of these algorithms for providing non-trivial approximations to the value of a game with ...

**Keywords**:
Strategy iteration, Concurrent reachability games, Value iteration, Analysis of algorithms

5

August 2013
CONCUR'13: Proceedings of the 24th international conference on Concurrency Theory

**Publisher:** Springer-Verlag

One-clock priced timed games is a class of two-player, zero-sum, continuous-time games that was defined and thoroughly studied in previous works. We show that one-clock priced timed games can be solved in time m 12 n n O (1) , where n is the number of states and m is ...

6

May 2013
AAMAS '13: Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems

**Publisher:** International Foundation for Autonomous Agents and Multiagent Systems

**Bibliometrics**:

Citation Count: 10

Downloads (6 Weeks): 1, Downloads (12 Months): 9, Downloads (Overall): 95

Full text available:

PDF
Cake cutting is a fundamental model in fair division; it represents the problem of fairly allocating a heterogeneous divisible good among agents with different preferences. The central criteria of fairness are proportionality and envy-freeness, and many of the existing protocols are designed to guarantee proportional or envy-free allocations, when the ...

**Keywords**:
fair division, game theory, cake cutting

7

February 2013
Journal of the ACM (JACM): Volume 60 Issue 1, February 2013

**Publisher:** ACM

**Bibliometrics**:

Citation Count: 10

Downloads (6 Weeks): 3, Downloads (12 Months): 34, Downloads (Overall): 539

Full text available:

PDF
Ye [2011] showed recently that the simplex method with Dantzig’s pivoting rule, as well as Howard’s policy iteration algorithm, solve discounted Markov decision processes (MDPs), with a constant discount factor, in strongly polynomial time. More precisely, Ye showed that both algorithms terminate after at most O ( mn 1− γ ...

**Keywords**:
policy iteration, turn-based stochastic games, strategy iteration, Markov decision processes, strongly polynomial algorithms

8

September 2012
ESA'12: Proceedings of the 20th Annual European conference on Algorithms

**Publisher:** Springer-Verlag

Gimbert and Horn gave an algorithm for solving simple stochastic games with running time O ( r ! n ) where n is the number of positions of the simple stochastic game and r is the number of its coin toss positions. Chatterjee et al. pointed out that a variant ...

9

June 2011
CSR'11: Proceedings of the 6th international conference on Computer science: theory and applications

**Publisher:** Springer-Verlag

Two standard algorithms for approximately solving two-player zerosum concurrent reachability games are value iteration and strategy iteration. We prove upper and lower bounds of 2 m Θ( N ) on the worst case number of iterations needed for both of these algorithms to provide non-trivial approximations to the value of ...

10

June 2011
STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computing

**Publisher:** ACM

**Bibliometrics**:

Citation Count: 11

Downloads (6 Weeks): 5, Downloads (12 Months): 17, Downloads (Overall): 377

Full text available:

PDF
Shapley's discounted stochastic games, Everett's recursive games and Gillette's undiscounted stochastic games are classical models of game theory describing two-player zero-sum games of potentially infinite duration. We describe algorithms for exactly solving these games. When the number of positions of the game isbconstant, our algorithms run in polynomial time.

**Keywords**:
stochastic games, real algebraic geometry

11

October 2010
SAGT'10: Proceedings of the Third international conference on Algorithmic game theory

**Publisher:** Springer-Verlag

The king of refinements of Nash equilibrium is trembling hand perfection. We show that it is NP-hard and Sqrt-Sum-hard to decide if a given pure strategy Nash equilibrium of a given three-player game in strategic form with integer payoffs is trembling hand perfect. Analogous results are shown for a number ...

12

May 2010
BQGT '10: Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions

**Publisher:** ACM

We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, our assumption being that bidders primarily care about monetary payoff and secondarily worry about exposing information about their type to other players and learning information about other players' ...

13

December 2009
ISAAC '09: Proceedings of the 20th International Symposium on Algorithms and Computation

**Publisher:** Springer-Verlag

We consider some well-known families of two-player zero-sum perfect-information stochastic games played on finite directed graphs. The families include stochastic parity games, stochastic mean payoff games, and simple stochastic games. We show that the tasks of solving games in each of these classes (quantitiatively or strategically) are all polynomial time ...

14

December 2009
ISAAC '09: Proceedings of the 20th International Symposium on Algorithms and Computation

**Publisher:** Springer-Verlag

We study the following question, communicated to us by Miklós Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0,1} w ) 3 �{0,1} w be computed by word circuits of constant size? A word circuit is an acyclic circuit where each wire holds a word (i.e., an ...

15

August 2009
CRYPTO '09: Proceedings of the 29th Annual International Cryptology Conference on Advances in Cryptology

**Publisher:** Springer-Verlag

We consider enhancing with privacy concerns a large class of auctions, which include sealed-bid single-item auctions but also general multi-item multi-winner auctions, our assumption being that bidders primarily care about monetary payoff and secondarily worry about exposing information about their type to other players and learning information about other players' ...

16

August 2009
LICS '09: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer Science

**Publisher:** IEEE Computer Society

We exhibit a deterministic concurrent reachability game PURGATORY$_n$ with $n$ non-terminal positions and a binary choice for both players in every position so that any positional strategy for Player 1 achieving the value of the game within given $\epsilon

17

May 2009
AAMAS '09: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2

**Publisher:** International Foundation for Autonomous Agents and Multiagent Systems

**Bibliometrics**:

Citation Count: 1

Downloads (6 Weeks): 0, Downloads (12 Months): 4, Downloads (Overall): 86

Full text available:

PDF
We consider existence and computation of symmetric Pure Strategy Nash Equilibrium (PSNE) in single-item, sealed-bid, first-price auctions with integral valuations and bids. For the most general case, we show that existence of PSNE is NP-hard. Then, we present algorithmic results for the case of independent valuations and two ways of ...

**Keywords**:
AAMAS proceedings, interactions::auctions and related structures, theoretical, economics

18

February 2009

This book constitutes the refereed proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2009, held in pindleruv Mln, Czech Republic, in January 2009. The 49 revised full papers, presented together with 9 invited contributions, were carefully reviewed and selected from 132 submissions. ...

19

January 2009
SIAM Journal on Computing: Volume 38 Issue 5, December 2008

**Publisher:** Society for Industrial and Applied Mathematics

We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis: (a) the Blum-Shub-Smale model of computation over the reals; and (b) a problem we call the “generic task of numerical computation,” which captures an aspect of doing numerical computation in floating point, similar to ...

**Keywords**:
straight-line programs, sum of square roots problem, Blum-Shub-Smale model, BPP, counting hierarchy, arithmetic circuits

20

December 2008
WINE '08: Proceedings of the 4th International Workshop on Internet and Network Economics

**Publisher:** Springer-Verlag

We consider approximating the minmax value of a multi-playergame in strategic form. Tightening recent bounds by Borgs et al.,we observe that approximating the value with a precision ofεlogn digits (for any constant ε> 0) isNP-hard, where n is the size of the game. On the other hand,approximating the value with a ...